login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A329562
a(n) = 2^(sum of digits of n).
1
1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 64, 128
OFFSET
0,2
COMMENTS
a(n) differs from A113019(n+9) starting at n = 19. - M. F. Hasler, Nov 17 2019
LINKS
FORMULA
a(n) = 2^A007953(n).
PROG
(PARI) {a(n) = 2^sumdigits(n)}
CROSSREFS
Sequence in context: A243087 A123464 A113019 * A069877 A085940 A061509
KEYWORD
nonn,base
AUTHOR
Seiichi Manyama, Nov 16 2019
STATUS
approved