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.

A258303 Number of partitions of 3*n^3 into parts that are at most n.

Original entry on oeis.org

1, 1, 13, 588, 53089, 7431069, 1432812535, 354709605775, 107681683621061, 38815870525676822, 16224696168627992214, 7722681288635179285337, 4126484069454572889453794, 2446850787696893234909546422, 1594892857383186062141424302309
Offset: 0

Views

Author

Vaclav Kotesovec, May 25 2015

Keywords

Crossrefs

Programs

  • Maple
    T:=proc(n,k) option remember; `if`(n=0 or k=1, 1, T(n,k-1) + `if`(n
    				

Formula

a(n) ~ exp(2*n + 1/12) * 3^(n-1) * n^(n-3) / (2*Pi).