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.

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

Original entry on oeis.org

1, 1, 9, 271, 16335, 1525940, 196284041, 32409332818, 6561153029810, 1577073620254149, 439541281384464800, 139493983910450106067, 49695878602452933374813, 19646816226938989587513067, 8537966749269377751401117583, 4046350906270352192325991177139
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/8) * 2^(n-1) * n^(n-3) / (2*Pi).