Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Mar 30 2012 16:49:29
%S 2,24,23,21,55,64,96,96,98,109,149,149,188,186,201,197,236,232
%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 number of steps N takes to converge.
%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. A072216, 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, Mar 29 2005; Oct 09 2005