|
Search: 1, 2, 4, 8, 16, 77, 145, 668, 1345, 6677, 13444, 55778
|
|
|
| A004000 |
|
RATS: Reverse Add Then Sort the digits applied to previous term, starting with 1.
(Formerly M1137)
|
|
+20
12
|
|
| 1, 2, 4, 8, 16, 77, 145, 668, 1345, 6677, 13444, 55778, 133345, 666677, 1333444, 5567777, 12333445, 66666677, 133333444, 556667777, 1233334444, 5566667777, 12333334444, 55666667777, 123333334444, 556666667777, 1233333334444
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
It is conjectured that no matter what the starting term is, repeatedly applying RATS leads either to this sequence or into a cycle of finite length, such as those in A066710 and A066711.
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. K. Guy, Conway's RATS and other reversals, Amer. Math. Monthly, 96 (1989), 425-428.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..200
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
FORMULA
|
Let a(n) = k, form m by Reversing the digits of k, Add m to k Then Sort the digits of the sum into increasing order to get a(n+1).
|
|
EXAMPLE
|
668 -> 668 + 866 = 1534 -> 1345.
|
|
MAPLE
|
read transforms; RATS := n -> digsort(n + digrev(n)); b := [1]; t := [1]; for n from 1 to 50 do t := RATS(t); b := [op(b), t]; od: b;
|
|
PROGRAM
|
(MAGMA) [ n eq 1 select 1 else Seqint(Reverse(Sort(Intseq(p + Seqint(Reverse(Intseq(p))) where p is Self(n-1))))) : n in [1..10]]; - from Sergei Haller (sergei(AT)sergei-haller.de), Dec 21 2006
|
|
CROSSREFS
|
Cf. A036839, A066710, A066711, A066713.
Sequence in context: A012997 A013184 A066713 this_sequence A051300 A001127 A051299
Adjacent sequences: A003997 A003998 A003999 this_sequence A004001 A004002 A004003
|
|
KEYWORD
|
base,nonn,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Entry revised Jan 19 2002
|
|
|
Search completed in 0.003 seconds
|
