login
A342251
Number of ways to write n as an ordered sum of eight powers of 2.
5
1, 8, 28, 64, 126, 224, 336, 464, 645, 840, 1044, 1344, 1666, 1904, 2192, 2528, 2730, 3024, 3528, 3920, 4284, 4768, 5168, 5488, 5965, 6552, 7140, 7616, 7834, 8176, 8400, 8352, 8862, 9632, 9800, 10080, 10788, 10976, 11152, 12208, 13090, 13664, 14392, 14672, 14868, 15008, 15344
OFFSET
8,2
LINKS
FORMULA
G.f.: ( Sum_{k>=0} x^(2^k) )^8.
MAPLE
N:= 100:
S:= add(x^(2^j), j=0..ilog2(N-7))^8:
seq(coeff(S, x, j), j=8..N); # Robert Israel, Feb 26 2023
MATHEMATICA
nmax = 54; CoefficientList[Series[Sum[x^(2^k), {k, 0, Floor[Log[2, nmax]] + 1}]^8, {x, 0, nmax}], x] // Drop[#, 8] &
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Mar 07 2021
STATUS
approved