A306600 - OEIS

A306600

In base 8, records for the number of 'Reverse and Add' steps needed to reach a palindrome.

0, 1, 2, 3, 6, 14, 17, 19, 21, 22, 23, 29, 30, 36, 46, 59, 60, 64, 67, 94, 95, 97, 120, 122, 133, 164

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

It is conjectured that if a Reverse and Add! trajectory reaches a palindrome, it will be reached in relatively few steps, or otherwise it will never reach a palindrome.

For all n, all numbers m < A306599(n) will reach a palindrome within a(n) Reverse and Add! steps, or otherwise it is conjectured never to reach a palindrome.

LINKS

Table of n, a(n) for n=0..25.

CROSSREFS

Record setting numbers in A306599.

Base 10: A065198 and A065199.

Sequence in context: A123041 A078557 A005537 * A282351 A193093 A182756

Adjacent sequences: A306597 A306598 A306599 * A306601 A306602 A306603

KEYWORD

nonn,base,more

AUTHOR

A.H.M. Smeets, Feb 27 2019

EXTENSIONS

a(21)-a(25) from A.H.M. Smeets, May 30 2019

STATUS

approved