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.

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

Original entry on oeis.org

1, 1, 17, 1027, 123464, 23030612, 5918918145, 1953335236481, 790541795804221, 379916850888632162, 211720519858133280231, 134359691058417334173117, 95719564240981718602134049, 75674822191817499226090337378, 65766024754772296807292428860854
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/16) * 4^(n-1) * n^(n-3) / (2*Pi).