%I A061563
%S A061563 0,2,4,6,8,11,33,55,77,99,11,22,33,44,55,66,77,88,99,121,22,33,44,55,66,
%T A061563 77,88,99,121,121,33,44,55,66,77,88,99,121,121,363,44,55,66,77,88,99,
%U A061563 121,121,363,484,55,66,77,88,99,121,121,363,484,1111,66,77,88,99,121
%N A061563 Start with n; add to itself with digits reversed; if palindrome, stop; 
               otherwise repeat; a(n) gives palindrome at which it stops, or -1 
               if no palindrome is ever reached.
%C A061563 It is believed that n = 196 ist the least integer which never reaches 
               a palindrome.
%H A061563 T. D. Noe, <a href="b061563.txt">Table of n, a(n) for n=0..195</a>
%H A061563 <a href="Sindx_Res.html#RAA">Index entries for sequences related to Reverse 
               and Add!</a>
%e A061563 19 -> 19 + 91 = 110 -> 110 + 011 = 121, so a(19) = 121.
%o A061563 (ARIBAS): var st: stack; test: boolean; end; for k := 0 to 60 do n := 
               k; test := true; while test do n := n + int_reverse(n); test := n 
               <> int_reverse(n); end; stack_push(st,n); end; stack2array(st).
%Y A061563 Cf. A033865. See also A016016, A023109, A006950, A023108.
%Y A061563 Sequence in context: A071241 A068062 A088169 this_sequence A099994 A068065 
               A028328
%Y A061563 Adjacent sequences: A061560 A061561 A061562 this_sequence A061564 A061565 
               A061566
%K A061563 nonn,base,easy,nice
%O A061563 0,2
%A A061563 N. J. A. Sloane (njas(AT)research.att.com), May 18 2001
%E A061563 Corrected and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), 
               May 20 2001
%E A061563 More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 25 
               2003