|
|
A161590
|
|
Initial value x of a RATS trajectory x->A036839(x) ending in a cycle unreachable by any smaller initial value.
|
|
4
|
|
|
1, 3, 9, 29, 69, 2079, 3999, 6999, 10677, 20169, 10049598, 20008989, 100014888, 100074268
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This is one way of book-keeping of new "destinies" (the smallest element of the cycle that the trajectory ends up in).
The value 1 is a placeholder for all non-cyclic trajectories.
Next terms are respectively <= 10000122228, 20000666679, 2000001113379, 2000001113559, 9999999999999, 100000044444447. See Branicky link for further upper bounds. - Michael S. Branicky, Dec 30 2022
|
|
LINKS
|
|
|
EXAMPLE
|
The RATS (Reverse Add Then Sort) algorithm applied to 69 produces a sequence 69, 156, 78, 156, 78, ...
Its cycle {156, 78} appears not if the algorithm is started with any number in the range 0 to 68, so 69 is added to the sequence.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|