%I A033865
%S A033865 0,1,2,3,4,5,6,7,8,9,11,11,33,44,55,66,77,88,99,121,22,33,22,55,66,77,
%T A033865 88,99,121,121,33,44,55,33,77,88,99,121,121,363,44,55,66,77,44,99,121,
%U A033865 121,363,484,55,66,77,88,99,55,121,363,484,1111,66,77,88,99,121,121,66,
               484,1111,4884,77,88,99,121,121,363,484,77,4884,44044,88
%N A033865 Start with n; if palindrome, stop; otherwise add to itself with digits 
               reversed; a(n) gives palindrome at which it stops, or -1 if no palindrome 
               is ever reached.
%D A033865 M. Donner, I Love Me, Vol. I: S. Wordrow's palindromic encyclopedia (Algonquin 
               Books, 1996) p. 268
%H A033865 T. D. Noe, <a href="b033865.txt">Table of n, a(n) for n=0..195</a>
%H A033865 O. Forster, <a href="http://www.mathematik.uni-muenchen.de/~forster/sw/
               aribas.html">ARIBAS</a>
%H A033865 Mathforum, <a href="http://mathforum.org/library/drmath/view/51508.html">
               Making Numbers into Palindromic Numbers</a>
%H A033865 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               196-Algorithm.html">Link to a section of The World of Mathematics.</
               a>
%e A033865 19 -> 19 + 91 = 110 -> 110 + 011 = 121, so a(19) = 121.
%o A033865 (ARIBAS): var st: stack; end; for k := 0 to 60 do n := k; while n <> 
               int_reverse(n) do n := n + int_reverse(n); end; stack_push(st,n); 
               end; stack2array(st).
%Y A033865 Cf. A061563, A016016, A023109, A006960, A023108, A002113.
%Y A033865 Sequence in context: A033862 A082273 A045876 this_sequence A118764 A057717 
               A063742
%Y A033865 Adjacent sequences: A033862 A033863 A033864 this_sequence A033866 A033867 
               A033868
%K A033865 nonn,base,nice
%O A033865 0,3
%A A033865 David W. Wilson (davidwwilson(AT)comcast.net)
%E A033865 Probably a(196) = -1.
%E A033865 More terms from Jenise Smalley (neicey01(AT)hotmail.com), Oct 18 2001