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.

A323975 a(n) sets a new record for the Lychrel number a(n) of 'Reverse and Add' steps, needed to reach a Lychrel number m < a(n) (i.e., its seed).

Original entry on oeis.org

195, 295, 4799, 10653, 10821, 14995, 105985, 1005523, 1008927, 1009413, 1029983
Offset: 1

Views

Author

A.H.M. Smeets, Feb 10 2019

Keywords

Comments

Records in A323976.
Similar to the number of steps needed to reach a palindrome in the Reverse and Add! trajectories (see A065198 and A065199), the number of steps needed for a Lychrel number to reach the trajectory of its seed is relatively small.

Crossrefs

Cf. A065198, A065199, A323976.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.