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