OFFSET
1,1
COMMENTS
Let T(S,Q) be the sequence obtained by starting with S and repeatedly reversing the digits and adding Q to get the next term. This is T(1013,2). 1013 is the first S for which T(S,2) reaches a cycle of length 90. The cycle is simply the first 90 terms, which then repeat. A full period is given in the table.
LINKS
Klaus Brockhaus, Table of n, a(n) for n = 1,...,90
N. J. A. Sloane and others, Sequences of RADD type, OEIS wiki.
Index entries for linear recurrences with constant coefficients, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
MATHEMATICA
NestList[IntegerReverse[#]+2&, 1013, 50] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Aug 16 2016 *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Klaus Brockhaus, Jun 11 2006
STATUS
approved