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.

A023013 Number of partitions of n into parts of 15 kinds.

Original entry on oeis.org

1, 15, 135, 920, 5220, 25893, 115700, 475065, 1817910, 6551390, 22414314, 73265580, 229972855, 696109950, 2039031360, 5796944357, 16036186005, 43259046975, 114012183695, 294067720380, 743368453326, 1844121021245, 4494803760045
Offset: 0

Views

Author

Keywords

Comments

a(n) is Euler transform of A010854. - Alois P. Heinz, Oct 17 2008

Crossrefs

15th column of A144064. - Alois P. Heinz, Oct 17 2008

Programs

  • Maple
    with(numtheory): a:= proc(n) option remember; `if`(n=0, 1, add(add(d*15, d=divisors(j)) *a(n-j), j=1..n)/n) end: seq(a(n), n=0..40); # Alois P. Heinz, Oct 17 2008
  • Mathematica
    CoefficientList[Series[1/QPochhammer[x]^15, {x, 0, 30}], x] (* Indranil Ghosh, Mar 27 2017 *)
  • PARI
    Vec(1/eta(x)^15 + O(x^30)) \\ Indranil Ghosh, Mar 27 2017

Formula

a(0) = 1, a(n) = (15/n)*Sum_{k=1..n} A000203(k)*a(n-k) for n > 0. - Seiichi Manyama, Mar 27 2017
a(n) ~ m^((m+1)/4) * exp(Pi*sqrt(2*m*n/3)) / (2^((3*m+5)/4) * 3^((m+1)/4) * n^((m+3)/4)) * (1 - ((9+Pi^2)*m^2+36*m+27) / (24*Pi*sqrt(6*m*n))), set m = 15. - Vaclav Kotesovec, Jun 28 2025