The OEIS is supported by the many generous donors to the OEIS Foundation.



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)



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.


Table of n, a(n) for n=1..10.

Tanya Khovanova, Destinies of Numbers [From Tanya Khovanova, Aug 10 2009]


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.


Cf. A036839, A066710, A066711, A004000, A114611, A161592, A161593, A161596.

Sequence in context: A058145 A218915 A258064 * A192245 A338645 A242558

Adjacent sequences: A161587 A161588 A161589 * A161591 A161592 A161593




J. H. Conway & Tanya Khovanova, Jun 14 2009, Jul 04 2009


10677, 20169 from Wouter Meeussen, Jul 04 2009

Definition rephrased by R. J. Mathar, Jul 08 2009



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 23:05 EST 2022. Contains 358710 sequences. (Running on oeis4.)