login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258299 Number of partitions of n*(n-1)*(n-2) into parts that are at most n. 5
1, 1, 1, 7, 169, 7166, 436140, 34690401, 3418486403, 402588217564, 55217486292383, 8650673262689142, 1524827150449505994, 298774748146352115019, 64436825369109396329518, 15171417879016739747222223, 3872658124805520661780283663, 1065387724298834666633864592587 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Vaclav Kotesovec, Table of n, a(n) for n = 0..89

FORMULA

a(n) ~ exp(2*n - 11/4) * n^(n-3) / (2*Pi).

MAPLE

T:=proc(n, k) option remember; `if`(n=0 or k=1, 1, T(n, k-1) + `if`(n<k, 0, T(n-k, k))) end proc: seq(T(n*(n-1)*(n-2), n), n=0..20);

CROSSREFS

Cf. A238608, A258297, A258298, A258300, A258301.

Sequence in context: A124126 A086373 A162131 * A012067 A012145 A005019

Adjacent sequences:  A258296 A258297 A258298 * A258300 A258301 A258302

KEYWORD

nonn

AUTHOR

Vaclav Kotesovec, May 25 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 13:24 EST 2021. Contains 349563 sequences. (Running on oeis4.)