Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Sep 24 2013 06:53:52
%S 10677,11667,12657,13647,14637,15627,16617,17607,20676,21666,22656,
%T 23646,24636,25626,26616,27606,30675,31665,32655,33645,34635,35625,
%U 36615,37605,40674,41664,42654,43644,44634,45624,46614,47604,50673
%N 53 'Reverse and Add' steps are needed to reach a palindrome.
%C The number of steps starts at 0, so palindromes (cf. A002113) are excluded. 53 is a record (cf. A065199) of the number of 'Reverse and Add' steps needed to reach a palindrome.
%C The first term not congruent 84 mod 99 is a(64) = 109902, thereafter the residues show no obvious pattern. - Klaus Brockhaus, Jul 14 2003
%H Vincenzo Librandi, <a href="/A065320/b065320.txt">Table of n, a(n) for n = 1..67</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, 54]] == 54; Select[Range[10000], lenQ] (* _Vincenzo Librandi_, Sep 24 2013 *)
%Y Cf. A002113, A065198, A065199, A065318.
%K nonn,base
%O 1,1
%A _Klaus Brockhaus_, Oct 30 2001
%E Changed offset from 0 to 1 by _Vincenzo Librandi_, Sep 24 2013