cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A329562 a(n) = 2^(sum of digits of n).

Original entry on oeis.org

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

Views

Author

Seiichi Manyama, Nov 16 2019

Keywords

Comments

a(n) differs from A113019(n+9) starting at n = 19. - M. F. Hasler, Nov 17 2019

Crossrefs

Programs

  • PARI
    {a(n) = 2^sumdigits(n)}

Formula

a(n) = 2^A007953(n).