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 #19 Dec 06 2024 16:24:35
%S 166,176,198,265,275,297,364,374,396,463,473,495,549,562,572,594,639,
%T 648,661,671,693,738,760,770,792,837,846,891,936,945,990,1396,1486,
%U 1576,1666,1697,1756,1787,1791,1793,1796,1846,1877,1883,1886,1890,1936
%N Numbers which need five 'Reverse and Add' steps to reach a palindrome.
%C The number of steps starts at 0, so palindromes (cf. A002113) are excluded.
%C Numbers k such that A033665(k) = 5. - _Andrew Howroyd_, Dec 06 2024
%H Harvey P. Dale, <a href="/A065210/b065210.txt">Table of n, a(n) for n = 1..3000</a>
%H <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%t palQ[k_]:=IntegerDigits[k]==Reverse[IntegerDigits[k]]; fraQ[n_]:= Module[ {ras=NestList[#+FromDigits[Reverse[IntegerDigits[#]]]&,n,5]},palQ/@ ras=={False,False,False,False,False,True}]; Select[Range[2000],fraQ] (* _Harvey P. Dale_, Sep 28 2015 *)
%Y Cf. A002113, A015982, A033665, A065206.
%K nonn,base
%O 1,1
%A _Klaus Brockhaus_, Oct 21 2001
%E Offset changed to 1 by _Harry J. Smith_, Oct 14 2009