|
| |
|
|
A161590
|
|
Initial value x of a RATS trajectory x->A036839(x) ending in a cycle unreachable by any smaller initial value.
|
|
4
| | |
|
|
|
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.
|
|
|
LINKS
| Tanya Khovanova, Destinies of Numbers [From Tanya Khovanova (tanyakh(AT)yahoo.com), Aug 10 2009]
|
|
|
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
| Cf. A036839, A066710, A066711, A004000, A114611, A161592, A161593, A161596.
Sequence in context: A148937 A047137 A058145 * A192245 A018361 A134325
Adjacent sequences: A161587 A161588 A161589 * A161591 A161592 A161593
|
|
|
KEYWORD
| nonn,base,more
|
|
|
AUTHOR
| John H. Conway & Tanya Khovanova (tanyakh(AT)yahoo.com), Jun 14 2009, Jul 04 2009
|
|
|
EXTENSIONS
| 10677, 20169 from Wouter Meeussen (wouter.meeussen(AT)pandora.be), Jul 04 2009
Definition rephrased by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 08 2009
|
| |
|
|
