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.

A072216 Consider the Reverse and Add! problem (cf. A001127); of all the n-digit numbers N which eventually reach a palindrome, pick that number N which takes the greatest number of steps to converge (in case of a tie, pick the smallest N); sequence gives values of N.

Original entry on oeis.org

5, 89, 187, 1297, 10911, 150296, 9008299, 15002893, 140669390, 1005499526, 10087799570
Offset: 1

Views

Author

N. J. A. Sloane, Jul 05 2002

Keywords

Comments

Since we do not even know if 196 eventually converges (see A006960, A023108) for n >= 3 these values are only conjectures.

Crossrefs

Extensions

Corrected and extended by Jason Doucette, May 20 2003; Oct 09 2005