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

%I #6 May 27 2015 09:12:58

%S 1,1,3,24,297,5260,123755,3648814,129828285,5425234114,260818130929,

%T 14194798070042,863357482347465,58068803644110427,4281318749672322843,

%U 343463734454952001605,29792472711307060688049,2778959190056157071592315,277420695604265258419161136

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

%H Vaclav Kotesovec, <a href="/A258301/b258301.txt">Table of n, a(n) for n = 0..118</a>

%F a(n) ~ exp(2*n + 9/4) * n^(n-3) / (2*Pi * 3^(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)*(2n+1)/6, n), n=0..20);

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

%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 April 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)