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.

A280264 G.f.: Product_{k>=1} (1+x^k) / (1+x^(k^3)).

Original entry on oeis.org

1, 0, 1, 1, 1, 2, 2, 3, 2, 5, 4, 6, 7, 8, 10, 12, 15, 16, 21, 23, 28, 33, 38, 44, 51, 60, 68, 79, 91, 103, 120, 136, 156, 177, 202, 230, 260, 296, 333, 378, 425, 480, 540, 606, 682, 764, 857, 958, 1073, 1197, 1337, 1492, 1660, 1849, 2057, 2285, 2537, 2816
Offset: 0

Views

Author

Vaclav Kotesovec, Dec 30 2016

Keywords

Comments

Number of partitions of n into distinct noncubes (A007412). - Ilya Gutkovskiy, Dec 31 2016

Crossrefs

Programs

  • Mathematica
    nmax=100; CoefficientList[Series[Product[(1+x^k)/(1+x^(k^3)), {k, 1, nmax}], {x, 0, nmax}], x]

Formula

a(n) ~ exp(Pi*sqrt(n/3) - (2^(1/3) - 1) * Gamma(1/3) * Zeta(4/3) * n^(1/6) / (3^(5/6) * Pi^(1/3))) / (2^(3/2) * 3^(1/4) * n^(3/4)).