cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A342252 Number of ways to write n as an ordered sum of nine powers of 2.

Original entry on oeis.org

1, 9, 36, 93, 198, 378, 624, 927, 1341, 1849, 2412, 3159, 4074, 4950, 5904, 7032, 8010, 9018, 10488, 11970, 13356, 15108, 16848, 18315, 20085, 22257, 24444, 26671, 28674, 30510, 32208, 33282, 34974, 37590, 39384, 40986, 43668, 45468, 46512, 49620, 53298, 55890, 59304, 62442
Offset: 9

Views

Author

Ilya Gutkovskiy, Mar 07 2021

Keywords

Crossrefs

Programs

  • Mathematica
    nmax = 52; CoefficientList[Series[Sum[x^(2^k), {k, 0, Floor[Log[2, nmax]] + 1}]^9, {x, 0, nmax}], x] // Drop[#, 9] &

Formula

G.f.: ( Sum_{k>=0} x^(2^k) )^9.