The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A342254 Number of ways to write n as an ordered sum of ten powers of 2. 3
 1, 10, 45, 130, 300, 612, 1095, 1750, 2655, 3850, 5281, 7110, 9460, 12060, 14940, 18352, 21850, 25380, 29790, 34740, 39672, 45480, 51885, 57870, 64375, 72090, 80145, 88630, 97660, 106380, 114736, 122260, 130050, 139740, 148990, 157572, 168240, 178200, 185490, 196200, 210082 (list; graph; refs; listen; history; text; internal format)
 OFFSET 10,2 LINKS Table of n, a(n) for n=10..50. FORMULA G.f.: ( Sum_{k>=0} x^(2^k) )^10. MATHEMATICA nmax = 50; CoefficientList[Series[Sum[x^(2^k), {k, 0, Floor[Log[2, nmax]] + 1}]^10, {x, 0, nmax}], x] // Drop[#, 10] & CROSSREFS Cf. A000079, A023359, A073267, A151759, A151760, A151761, A151762, A209229, A319922, A342250, A342251, A342252. Sequence in context: A045852 A226450 A105938 * A226254 A340966 A022605 Adjacent sequences: A342251 A342252 A342253 * A342255 A342256 A342257 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Mar 07 2021 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 10:56 EST 2023. Contains 367589 sequences. (Running on oeis4.)