The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) differs from A113019(n+9) starting at n = 19. - M. F. Hasler, Nov 17 2019 LINKS Seiichi Manyama, Table of n, a(n) for n = 0..10000 FORMULA a(n) = 2^A007953(n). PROG (PARI) {a(n) = 2^sumdigits(n)} CROSSREFS Cf. A007953, A328882. Sequence in context: A243087 A123464 A113019 * A069877 A085940 A061509 Adjacent sequences:  A329559 A329560 A329561 * A329563 A329564 A329565 KEYWORD nonn,base AUTHOR Seiichi Manyama, Nov 16 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 29 09:21 EDT 2022. Contains 354910 sequences. (Running on oeis4.)