login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258300 Number of partitions of n*(n-1)*(n-2)/6 into parts that are at most n. 5

%I

%S 1,1,1,1,5,30,282,3539,55974,1065947,23785645,608889106,17594781914,

%T 566603884871,20123663539549,781500841147604,32946304088342094,

%U 1498526109256063585,73147202427442412812,3814178439827570160925,211598573411998923138880

%N Number of partitions of n*(n-1)*(n-2)/6 into parts that are at most n.

%H Vaclav Kotesovec, <a href="/A258300/b258300.txt">Table of n, a(n) for n = 0..141</a>

%F a(n) ~ exp(2*n - 3/2) * n^(n-3) / (2*Pi * 6^(n-1)).

%p 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)/6, n), n=0..20);

%Y Cf. A238608, A258297, A258298, A258299, A258301.

%K nonn

%O 0,5

%A _Vaclav Kotesovec_, May 25 2015

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 05:45 EDT 2022. Contains 354048 sequences. (Running on oeis4.)