login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065210 Five 'Reverse and Add' steps are needed to reach a palindrome. 3

%I #16 Dec 20 2018 15:36:37

%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 Five '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 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, 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 14:10 EDT 2024. Contains 371792 sequences. (Running on oeis4.)