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.

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

Offset

1,1

Comments

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

Links

Table of n, a(n) for n=1..11.

Jason Doucette, World records

Index entries for sequences related to Reverse and Add!

Crossrefs

Cf. A072217, A072218, A001127, A006960, A023108.

Sequence in context: A138700 A139937 A059696 * A176608 A277233 A167735

Adjacent sequences: A072213 A072214 A072215 * A072217 A072218 A072219

Keyword

nonn,hard,base

Author

N. J. A. Sloane, Jul 05 2002

Extensions

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

Status

approved