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 A065319 #10 Sep 24 2013 06:54:48 %S A065319 10548,11538,12528,13518,14508,20547,21537,22527,23517,24507,30546, %T A065319 31536,32526,33516,34506,40545,40849,41535,41839,42525,42829,43515, %U A065319 43819,44505,44809,44899,45889,46879,47869,48859,49849,50544,50848 %N A065319 30 'Reverse and Add' steps are needed to reach a palindrome. %C A065319 The number of steps starts at 0, so palindromes (cf. A002113) are excluded. 30 is a record (cf. A065199) of the number of 'Reverse and Add' steps needed to reach a palindrome. %H A065319 Vincenzo Librandi, <a href="/A065319/b065319.txt">Table of n, a(n) for n = 1..1000</a> %H A065319 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a> %t A065319 lenQ[n_]:= Length[NestWhileList[# + FromDigits[Reverse[IntegerDigits[#]]]&, n, #! = FromDigits[Reverse[IntegerDigits[#]]]&, 1, 31]] == 31; Select[Range[10000], lenQ] (* _Vincenzo Librandi_, Sep 24 2013 *) %Y A065319 Cf. A002113, A065198, A065199, A065318. %K A065319 nonn,base %O A065319 1,1 %A A065319 _Klaus Brockhaus_, Oct 30 2001 %E A065319 Changed offset from 0 to 1 by _Vincenzo Librandi_, Sep 24 2013