|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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:
|
|
MATHEMATICA
|
nmax = 54; CoefficientList[Series[Sum[x^(2^k), {k, 0, Floor[Log[2, nmax]] + 1}]^8, {x, 0, nmax}], x] // Drop[#, 8] &
|
|
CROSSREFS
|
Cf. A000079, A023359, A073267, A151759, A151760, A151761, A151762, A209229, A342248, A342250, A342252, A342254.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|