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 #16 Dec 08 2024 14:15:31
%S 167,266,365,563,662,761,860,7069,7159,7249,7339,7429,7519,7609,7699,
%T 7789,7879,7969,8068,8158,8248,8428,8518,8608,8698,8788,8878,8968,
%U 9039,9067,9129,9157,9219,9247,9309,9337,9399,9427,9489,9517,9579,9607,9697
%N Numbers which need eleven '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) = 11. - _Andrew Howroyd_, Dec 08 2024
%H Vincenzo Librandi, <a href="/A065216/b065216.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, 12]] == 12; Select[Range[1000], lenQ] (* _Vincenzo Librandi_, Sep 24 2013 *)
%Y A002113, A015992, A033665, A065206.
%K nonn,base
%O 1,1
%A _Klaus Brockhaus_, Oct 21 2001
%E Offset changed from 0 to 1 by _Harry J. Smith_, Oct 14 2009