This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A065208 #18 May 30 2025 23:14:47
%S A065208 59,68,86,95,155,156,157,158,164,165,168,178,180,184,185,186,194,199,
%T A065208 249,254,255,256,257,263,264,267,277,283,284,285,293,298,299,348,349,
%U A065208 354,355,356,362,366,376,382,384,389,392,397,398,399,439,447,448,449,452,453,455,461,462,465,475,481,482
%N A065208 Numbers which need three 'Reverse and Add' steps to reach a palindrome.
%C A065208 The number of steps starts at 0, so palindromes (cf. A002113) are excluded.
%C A065208 Numbers k such that A033665(k) = 3. - _Andrew Howroyd_, Dec 06 2024
%H A065208 Harry J. Smith, <a href="/A065208/b065208.txt">Table of n, a(n) for n = 1..1000</a>
%H A065208 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%t A065208 palQ[n_]:=Module[{idn=IntegerDigits[n]},idn==Reverse[idn]]
%t A065208 tst[n_]:=palQ/@NestList[#+FromDigits[Reverse[IntegerDigits[#]]]&,n,3]=={False,False,False,True}
%t A065208 Select[Range[750],tst] (* _Harvey P. Dale_, Nov 26 2010 *)
%o A065208 (ARIBAS) revadd_steps(3,54). For the definition of function revadd_steps see A065206.
%o A065208 (PARI) isok(n,s=3)={for(k=0, s, my(r=fromdigits(Vecrev(digits(n)))); if(r==n, return(k==s)); n += r); 0} \\ _Andrew Howroyd_, Dec 06 2024
%Y A065208 Cf. A002113, A015979, A033665, A065206.
%K A065208 nonn,base
%O A065208 1,1
%A A065208 _Klaus Brockhaus_, Oct 21 2001
%E A065208 Offset changed from 0 to by _Harry J. Smith_, Oct 14 2009
%E A065208 More terms from _Harvey P. Dale_, Nov 26 2010