The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A072218 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 palindrome that is reached. 10
 11, 8813200023188, 8813200023188, 8813200023188, 4668731596684224866951378664, 682049569465550121055564965940286, 555458774083726674580862268085476627380477854555, 555458774083726674580862268085476627380477854555, 1345428953367763125675365555635765213677633598245431 (list; graph; refs; listen; history; text; internal format)
 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 Jason Doucette, World records CROSSREFS Cf. A072216, A072217, A001127, A006960, A023108. Sequence in context: A257131 A257129 A213647 * A046844 A198244 A066953 Adjacent sequences:  A072215 A072216 A072217 * A072219 A072220 A072221 KEYWORD nonn,hard,base AUTHOR N. J. A. Sloane, Jul 05 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 18 15:54 EDT 2021. Contains 343089 sequences. (Running on oeis4.)