%I M0983 #30 Jun 20 2023 05:39:14
%S 0,2,4,6,8,1,3,5,7,9,11,31,33,53,55,75,77,97,99,101,301,303,503,505,
%T 705,707,907,909,119,121,321,323,523,525,725,727,927,929,139,141,341,
%U 343,543,545,745,747,947,949,159,161,361,363,563,565,765,767,967,969,179
%N Add 2, then reverse digits!.
%C At 6, the sequence becomes periodic with period 81. [_T. D. Noe_, Oct 05 2008]
%D J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 15.
%D David Singmaster, Proposer, Elementary Problem E3254, Amer. Math. Monthly, Vol. 97, No. 10, December 1990, pages 922-924. [_N. J. A. Sloane_, Jun 20 2023]
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H T. D. Noe, <a href="/A007396/b007396.txt">Table of n, a(n) for n = 0..1000</a>
%H Nick Hobson, <a href="/A007396/a007396.py.txt">Python program for this sequence</a>
%H <a href="/index/Rec#order_81">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%t s=0; Join[{s}, Table[s=FromDigits[Reverse[IntegerDigits[2+s]]], {100}]] (* _T. D. Noe_, Oct 05 2008 *)
%t NestList[FromDigits[Reverse[IntegerDigits[#+2]]]&,0,100] (* _Harvey P. Dale_, Mar 13 2011 *)
%Y Cf. A117521. [_T. D. Noe_, Oct 05 2008]
%K nonn,base,easy
%O 0,2
%A _N. J. A. Sloane_.
%E More terms from _Jon E. Schoenfield_ and _John W. Layman_, Mar 27 2010