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 A065215 #15 Dec 08 2024 14:15:25 %S A065215 829,928,9059,9149,9239,9329,9419,9509,9599,9689,9869,9959,10634, %T A065215 10637,10687,10716,10808,10834,10838,10867,10873,10898,10927,10979, %U A065215 11398,11624,11627,11677,11706,11824,11828,11857,11863,11888,11917,11969,12388,12392,12398,12493 %N A065215 Numbers which need ten 'Reverse and Add' steps to reach a palindrome. %C A065215 The number of steps starts at 0, so palindromes (cf. A002113) are excluded. %C A065215 Numbers k such that A033665(k) = 10. - _Andrew Howroyd_, Dec 08 2024 %H A065215 Vincenzo Librandi, <a href="/A065215/b065215.txt">Table of n, a(n) for n = 1..1000</a> %H A065215 <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a> %t A065215 lenQ[n_]:= Length[NestWhileList[# + FromDigits[Reverse[IntegerDigits[#]]]&, n, #!= FromDigits[Reverse[IntegerDigits[#]]]&, 1, 11]] == 11; Select[Range[1000], lenQ] (* _Vincenzo Librandi_, Sep 24 2013 *) %Y A065215 Cf. A002113, A015991 (a different version), A033665, A065206. %K A065215 nonn,base %O A065215 1,1 %A A065215 _Klaus Brockhaus_, Oct 21 2001