A066713 RATS(2^n): Reverse Add the digits of 2^n, Then Sort: a(n) = A036839(2^n).

2, 4, 8, 16, 77, 55, 11, 499, 89, 277, 2255, 145, 11, 1111, 44567, 111499, 12299, 1234, 3467, 113467, 677789, 144556, 1222889, 14445667, 4577789, 55669999, 1134899, 11356999, 12237899, 445557799, 1223555555, 11113366, 1122222266

Offset

0,1

Comments

A114611(a(n)) = 0, as A114611(A000079(n)) = 0. - Reinhard Zumkeller, Mar 14 2012

Links

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000

Eric Weisstein's World of Mathematics, RATS Sequence

Prog

(Haskell)
a066713 = a036839 . (2 ^)  -- Reinhard Zumkeller, Mar 14 2012
(Python)
def A066713(n):
    m = 2**n
    return int(''.join(sorted(str(m+int(str(m)[::-1]))))) # Chai Wah Wu, Feb 07 2020

Crossrefs

See A004000, A036839 for more information.

Sequence in context: A013133 A012997 A013184 * A004000 A051300 A001127

Adjacent sequences: A066710 A066711 A066712 * A066714 A066715 A066716

Keyword

nonn,base

Author

N. J. A. Sloane, Jan 19 2002

Status

approved