The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #4 Mar 07 2021 12:17:23
%S 1,10,45,130,300,612,1095,1750,2655,3850,5281,7110,9460,12060,14940,
%T 18352,21850,25380,29790,34740,39672,45480,51885,57870,64375,72090,
%U 80145,88630,97660,106380,114736,122260,130050,139740,148990,157572,168240,178200,185490,196200,210082
%N Number of ways to write n as an ordered sum of ten powers of 2.
%F G.f.: ( Sum_{k>=0} x^(2^k) )^10.
%t nmax = 50; CoefficientList[Series[Sum[x^(2^k), {k, 0, Floor[Log[2, nmax]] + 1}]^10, {x, 0, nmax}], x] // Drop[#, 10] &
%Y Cf. A000079, A023359, A073267, A151759, A151760, A151761, A151762, A209229, A319922, A342250, A342251, A342252.
%K nonn
%O 10,2
%A _Ilya Gutkovskiy_, Mar 07 2021