The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A119031 Add and Reverse: a(n) = the reversal of (a(n-1)+d), case a(1)=1 and d=4. 5

%I

%S 1,5,9,31,53,75,97,101,501,505,905,909,319,323,723,727,137,141,541,

%T 545,945,949,359,363,763,767,177,181,581,585,985,989,399,304,803,708,

%U 217,122,621,526,35,93,79,38,24,82,68,27,13,71,57,16,2,6,1,5,9,31,53,75,97

%N Add and Reverse: a(n) = the reversal of (a(n-1)+d), case a(1)=1 and d=4.

%C Cycle of length 54. [Corrected by _N. J. A. Sloane_, Aug 02 2009]

%t Nest[Append[#, IntegerReverse[#[[-1]] + 4]] &, {1}, 60] (* _Michael De Vlieger_, Mar 14 2021 *)

%o (Python)

%o a = 1

%o counter = 0

%o while counter < 60:

%o print(a)

%o counter += 1

%o a = int(str(a + 4)[::-1]) # _Mattew Bondar_, Mar 14 2021

%Y All of A003608, A016081, A016082 (and possibly others) eventually reach the trajectory of 1 shown in A119031. Cf. A055198.

%Y Cf. A016081 (case a(1)=3).

%K nonn,base

%O 1,2

%A _Zak Seidov_, May 09 2006

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

Last modified April 20 15:38 EDT 2021. Contains 343135 sequences. (Running on oeis4.)