cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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
Offset: 0

Views

Author

A.H.M. Smeets, Feb 27 2019

Keywords

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.

Crossrefs

Record setting numbers in A306599.
Base 10: A065198 and A065199.

Extensions

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