|
%I #15 Apr 25 2022 09:25:51
%S 0,0,0,0,0,1,5,10,15,25,31,30,40,50,50,60,75,65,55,70,66,70,90,100,
%T 100,90,90,100,110,100,120,120,75,65,95,70,90,110,130,100,126,110,130,
%U 140,150,140,160,120,100,90,130,100,150,140,160,120,110,100,160,120,120,120,120
%N G.f.: Theta^5, where Theta = Sum_{k>=0} x^(2^k).
%C Number of ways to write n as an ordered sum of 5 powers of 2. - _Ilya Gutkovskiy_, Feb 02 2021
%H Seiichi Manyama, <a href="/A151761/b151761.txt">Table of n, a(n) for n = 0..10000</a>
%p b:= proc(n, t) option remember; `if`(n=0, `if`(t=0, 1, 0),
%p `if`(t<1, 0, add(b(n-2^j, t-1), j=0..ilog2(n))))
%p end:
%p a:= n-> b(n, 5):
%p seq(a(n), n=0..62); # _Alois P. Heinz_, Feb 02 2021
%t b[n_, t_] := b[n, t] = If[n == 0, If[t == 0, 1, 0],
%t If[t < 1, 0, Sum[b[n - 2^j, t - 1], {j, 0, Floor@Log2[n]}]]];
%t a[n_] := b[n, 5];
%t Table[a[n], {n, 0, 62}] (* _Jean-François Alcover_, Apr 25 2022, after _Alois P. Heinz_ *)
%Y (Sum_{k>=0} x^(2^k))^m; A209229 (m=1), A073267 (m=2), A151759 (m=3), A151760 (m=4), this sequence (m=5), A151762 (m=6).
%Y Cf. A151758.
%K nonn
%O 0,7
%A _N. J. A. Sloane_, Jun 22 2009
|
