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.

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).

Original entry on oeis.org

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

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

Crossrefs

Records in A306600.
Base 10: A065198 and A065199.

Extensions

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