%I A062932
%S A062932 1,2,3,4,5,6,16,17,27,28,38,39,49,50,51,60,61,70,71,80,81,90,91,100,
%T A062932 102,110,112,120,122,130,132,140,142,150,153,160,163,170,173,180,183,
%U A062932 190,193,200,204,210,214,220,224,230,234,240,244,250,255,260,265,270
%N A062932 a(1) = 1; a(n) = smallest number > a(n-1) such that a(n-1)+a(n) is a 
               palindrome.
%H A062932 Harry J. Smith, <a href="b062932.txt">Table of n, a(n) for n=1,...,1000</
               a>
%e A062932 17 is a term hence the next term is 27 as 17+27 = 44 is a palindrome.
%o A062932 (PARI) digitsIn(x)= { local(d); if (x==0, return(1)); d=1 + log(x)\log(10); 
               if (10^d == x, d++, if (10^(d-1) > x, d--)); return(d) } Palin(x)= 
               { local(y,d,e,f); if (x==0, return(1)); y=x; d=digitsIn(x); t=10^(d 
               - 1); for (i=1, d\2, f=y-10*(y\10); y\=10; e=x\t; x-=t*e; t/=10; 
               if (e!=f, return(0)) ); return(1) } { for (n=1, 1000, if (n>1, while 
               (!Palin(a1 + a++),); a1=a, a=a1=1); write("b062932.txt", n, " ", 
               a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 13 2009]
%Y A062932 Sequence in context: A138987 A004835 A037341 this_sequence A166098 A124365 
               A115896
%Y A062932 Adjacent sequences: A062929 A062930 A062931 this_sequence A062933 A062934 
               A062935
%K A062932 nonn,base,easy
%O A062932 1,2
%A A062932 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 05 2001
%E A062932 Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jul 02 2001