|
%I #32 Sep 15 2023 05:25:34
%S 1,1,2,1,4,2,8,1,16,4,32,2,64,8,128,1,256,16,512,4,1024,32,2048,2,
%T 4096,64,8192,8,16384,128,32768,1,65536,256,131072,16,262144,512,
%U 524288,4,1048576,1024,2097152,32,4194304,2048,8388608,2,16777216
%N Expansion of (1/x) * Sum_{k>=0} x^2^k / (1 - 2*x^2^(k+1)).
%H Seiichi Manyama, <a href="/A082392/b082392.txt">Table of n, a(n) for n = 0..5000</a>
%H Ralf Stephan, <a href="/somedcgf.html">Some divide-and-conquer sequences ...</a>
%H Ralf Stephan, <a href="/A079944/a079944.ps">Table of generating functions</a>
%F a(0) = 1, a(2*n) = 2^n, a(2*n+1) = a(n).
%F a(n) = 2^A025480(n) = 2^(A003602(n)-1).
%F a((2*n+1)*2^p-1) = 2^n, p >= 0 and n >= 0. - _Johannes W. Meijer_, Feb 11 2013
%p nmax := 48: for p from 0 to ceil(simplify(log[2](nmax))) do for n from 0 to ceil(nmax/(p+2))+1 do a((2*n+1)*2^p-1) := 2^n od: od: seq(a(n), n=0..nmax); # _Johannes W. Meijer_, Feb 11 2013
%p A082392 := proc(n)
%p 2^A025480(n) ;
%p end proc:
%p seq(A082392(n),n=0..100) ; # _R. J. Mathar_, Jul 16 2020
%t a[n_] := 2^(((n+1)/2^IntegerExponent[n+1, 2]+1)/2-1);
%t Table[a[n], {n, 0, 100}] (* _Jean-François Alcover_, Sep 15 2023 *)
%o (PARI) for(n=0, 50, l=ceil(log(n+1)/log(2)); t=polcoeff(sum(k=0, l, (x^2^k)/(1-2*x^2^(k+1)))/x + O(x^(n+1)), n); print1(t", ");) ;
%Y Cf. A045654, A220466.
%K nonn,easy
%O 0,3
%A _Ralf Stephan_, Jun 07 2003
|
