|
%I #23 Jul 04 2022 11:30:16
%S 1,2,3,4,10,11,12,13,14,15,16,17,18,20,21,22,23,24,25,26,27,29,30,31,
%T 32,33,34,35,36,38,40,41,42,43,44,45,47,50,51,52,53,54,56,60,61,62,63,
%U 65,70,71,72,74,80,81,83,90,92,100,101,102,103,104,105,106
%N One iteration of Reverse and Add is needed to reach a palindrome.
%C The number of iterations starts at 1, so palindromes (cf. A002113) are not excluded. The corresponding sequence excluding palindromes is A065206.
%H Reinhard Zumkeller, <a href="/A015976/b015976.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Res#RAA">Index entries for sequences related to Reverse and Add!</a>
%t rev[n_] := FromDigits[Reverse[IntegerDigits[n]]]; Select[Range[106], rev[x = # + rev[#]] == x &] (* _Jayanta Basu_, Jul 24 2013 *)
%t Select[Range[120],PalindromeQ[#+IntegerReverse[#]]&] (* _Harvey P. Dale_, Jul 04 2022 *)
%o (Haskell)
%o a015976 n = a015976_list !! (n-1)
%o a015976_list = filter ((== 1) . a136522 . a056964) [1..]
%o -- _Reinhard Zumkeller_, Oct 14 2011
%Y Cf. A002113, A065206.
%K nonn,base,look
%O 1,2
%A _Robert G. Wilson v_
%E Offset corrected by _Reinhard Zumkeller_, Oct 14 2011
|
