|
|
A118879
|
|
Let T(S,Q) be the sequence obtaining by starting with S and repeatedly reversing the digits and adding Q to get the next term. This is T(1016,5), the first S for which T(S,5) reaches a cycle of length 36.
|
|
3
|
|
|
1016, 6106, 6021, 1211, 1126, 6216, 6131, 1321, 1236, 6326, 6241, 1431, 1346, 6436, 6351, 1541, 1456, 6546, 6461, 1651, 1566, 6656, 6571, 1761, 1676, 6766, 6681, 1871, 1786, 6876, 6791, 1981, 1896, 6986, 6901, 1101, 1016, 6106, 6021
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
The cycle is simply the first 36 terms, which then repeat.
For S < 1016, T(S,5) reaches a cycle of length 207 (cf. A117800).
|
|
LINKS
|
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, 1).
|
|
MATHEMATICA
|
NestList[IntegerReverse[#]+5&, 1016, 40] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Mar 05 2020 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|