A065214 - OEIS

%I #11 Sep 24 2013 02:53:03

%S 1397,1487,1577,1667,1757,1847,1937,2396,2486,2576,2666,2756,2846,

%T 2936,2999,3395,3485,3575,3665,3755,3845,3935,3998,4394,4484,4574,

%U 4754,4844,4934,4997,5393,5483,5573,5663,5753,5843,5933,5996,6392,6482,6572

%N Numbers n such that nine 'Reverse and Add' steps are needed to reach a palindrome.

%C The number of steps starts at 0, so palindromes (cf. A002113) are excluded.

%H Vincenzo Librandi, <a href="/A065214/b065214.txt">Table of n, a(n) for n = 1..1000</a>

%H <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>

%t lenQ[n_]:= Length[NestWhileList[# + FromDigits[Reverse[IntegerDigits[#]]]&, n, #!= FromDigits[Reverse[IntegerDigits[#]]]&, 1, 10]] == 10; Select[Range[1000], lenQ] (* _Vincenzo Librandi_, Sep 24 2013 *)

%Y Cf. A002113, A065206. Different from A015990.

%K nonn,base

%O 1,1

%A _Klaus Brockhaus_, Oct 21 2001