%I #11 Oct 01 2018 18:16:45
%S 0,0,0,0,0,0,0,0,0,0,1,1,1,2,2,2,3,4,4,5,6,5,6,6,7,8,9,8,10,9,10,11,
%T 13,11,14,12,13,12,15,12,16,14,16,14,18,15,19,17,21,18,22,17,22,18,22,
%U 19,25,19,24,20,25,21,28,21,27,21,26,19,27,20,26,19
%N Number of ways of writing n as a sum of exactly 10 powers of 2.
%H Alois P. Heinz, <a href="/A319922/b319922.txt">Table of n, a(n) for n = 0..65536</a>
%F a(n) = [x^n y^10] 1/Product_{j>=0} (1-y*x^(2^j)).
%p h:= proc(n) option remember; `if`(n<1, 0,
%p `if`(n=2^ilog2(n), n, h(n-1)))
%p end:
%p b:= proc(n, i, k) option remember; `if`(n=0, `if`(k=0, 1, 0), `if`(
%p k>n or i*k<n, 0, b(n, h(i-1), k)+b(n-i, h(min(n-i, i)), k-1)))
%p end:
%p a:= n-> b(n, h(n), 10):
%p seq(a(n), n=0..120);
%Y Column k=10 of A089052.
%Y Cf. A000079.
%K nonn,look
%O 0,14
%A _Alois P. Heinz_, Oct 01 2018