A306599 In base 8: a(n) sets a new record for the number of Reverse and Add! steps needed to reach a palindrome starting with a(n).

0, 8, 15, 39, 47, 109, 375, 1591, 4470, 4596, 6393, 6718, 7930, 16439, 28903, 34292, 49465, 264496, 265750, 266126, 311290, 2067455, 16808764, 18276328, 1074296036, 1075478361

Offset

0,2

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. - A.H.M. Smeets, May 30 2019

Links

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

Crossrefs

Records in A306600.

Base 10: A065198 and A065199.

Sequence in context: A134020 A343141 A197602 * A226151 A253767 A254541

Adjacent sequences: A306596 A306597 A306598 * A306600 A306601 A306602

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