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).

This page as a plain text file.
%I A329562 #14 Nov 19 2019 06:00:21
%S A329562 1,2,4,8,16,32,64,128,256,512,2,4,8,16,32,64,128,256,512,1024,4,8,16,
%T A329562 32,64,128,256,512,1024,2048,8,16,32,64,128,256,512,1024,2048,4096,16,
%U A329562 32,64,128,256,512,1024,2048,4096,8192,32,64,128,256,512,1024,2048,4096,8192,16384,64,128
%N A329562 a(n) = 2^(sum of digits of n).
%C A329562 a(n) differs from A113019(n+9) starting at n = 19. - _M. F. Hasler_, Nov 17 2019
%H A329562 Seiichi Manyama, <a href="/A329562/b329562.txt">Table of n, a(n) for n = 0..10000</a>
%F A329562 a(n) = 2^A007953(n).
%o A329562 (PARI) {a(n) = 2^sumdigits(n)}
%Y A329562 Cf. A007953, A328882.
%K A329562 nonn,base
%O A329562 0,2
%A A329562 _Seiichi Manyama_, Nov 16 2019