The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #9 Mar 30 2012 16:49:29
%S 5,89,187,1297,10911,150296,9008299,15002893,140669390,1005499526,
%T 10087799570
%N 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.
%C Since we do not even know if 196 eventually converges (see A006960, A023108) for n >= 3 these values are only conjectures.
%H Jason Doucette, <a href="http://www.jasondoucette.com/worldrecords.html">World records</a>
%H <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%Y Cf. A072217, A072218, A001127, A006960, A023108.
%K nonn,hard,base
%O 1,1
%A _N. J. A. Sloane_, Jul 05 2002
%E Corrected and extended by Jason Doucette, May 20 2003; Oct 09 2005