|
Search: id:A036839
|
|
|
| A036839 |
|
RATS(n): Reverse Add Then Sort the digits of n. |
|
+0
5
|
|
| 0, 2, 4, 6, 8, 1, 12, 14, 16, 18, 11, 22, 33, 44, 55, 66, 77, 88, 99, 11, 22, 33, 44, 55, 66, 77, 88, 99, 11, 112, 33, 44, 55, 66, 77, 88, 99, 11, 112, 123, 44, 55, 66, 77, 88, 99, 11, 112, 123, 134, 55, 66, 77, 88, 99, 11, 112, 123, 134, 145, 66, 77
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n) = RATS(n), not RATS(a(n-1)).
|
|
REFERENCES
|
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=0..1000
|
|
FORMULA
|
Form m by Reversing the digits of n, Add m to n Then Sort the digits of the sum into increasing order to get a(n).
|
|
EXAMPLE
|
1 -> 1+1 = 2, so a(1) = 2; 3 -> 3 + 3 = 6, so a(3) = 6.
|
|
MAPLE
|
read transforms; RATS := n -> digsort(n + digrev(n));
|
|
CROSSREFS
|
Cf. A004000.
Sequence in context: A077492 A007396 A004519 this_sequence A004093 A106202 A064745
Adjacent sequences: A036836 A036837 A036838 this_sequence A036840 A036841 A036842
|
|
KEYWORD
|
base,nonn,nice,easy
|
|
AUTHOR
|
njas, Jan 19, 2002
|
|
|
Search completed in 0.002 seconds
|
