cp's OEIS Frontend

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.

%I A072218 #6 Mar 30 2012 16:49:29
%S A072218 11,8813200023188,8813200023188,8813200023188,
%T A072218 4668731596684224866951378664,682049569465550121055564965940286,
%U A072218 555458774083726674580862268085476627380477854555,555458774083726674580862268085476627380477854555,1345428953367763125675365555635765213677633598245431
%N 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.
%C A072218 Since we do not even know if 196 eventually converges (see A006960, A023108) for n >= 3 these values are only conjectures.
%H A072218 Jason Doucette, <a href="http://www.jasondoucette.com/worldrecords.html">World records</a>
%H A072218 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%Y A072218 Cf. A072216, A072217, A001127, A006960, A023108.
%K A072218 nonn,hard,base
%O A072218 1,1
%A A072218 _N. J. A. Sloane_, Jul 05 2002