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!)
A258298 Number of partitions of n*(n+1)*(n+2)/6 into parts that are at most n. 5

%I #6 May 27 2015 09:19:56

%S 1,1,3,14,108,1115,14800,239691,4602893,102442041,2596767156,

%T 73937412122,2338157235782,81358388835166,3090548185022616,

%U 127310130911561966,5654266354725389764,269396637045530725099,13708631585852580662781,742141584297248778501411

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

%H Vaclav Kotesovec, <a href="/A258298/b258298.txt">Table of n, a(n) for n = 0..135</a>

%F a(n) ~ exp(2*n + 9/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, A258299, A258300, A258301.

%K nonn

%O 0,3

%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 March 3 13:41 EST 2024. Contains 370512 sequences. (Running on oeis4.)