cp's OEIS Frontend

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

%I A258301 #6 May 27 2015 09:12:58
%S A258301 1,1,3,24,297,5260,123755,3648814,129828285,5425234114,260818130929,
%T A258301 14194798070042,863357482347465,58068803644110427,4281318749672322843,
%U A258301 343463734454952001605,29792472711307060688049,2778959190056157071592315,277420695604265258419161136
%N A258301 Number of partitions of n*(n+1)*(2n+1)/6 into parts that are at most n.
%H A258301 Vaclav Kotesovec, <a href="/A258301/b258301.txt">Table of n, a(n) for n = 0..118</a>
%F A258301 a(n) ~ exp(2*n + 9/4) * n^(n-3) / (2*Pi * 3^(n-1)).
%p A258301 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 A258301 Cf. A238608, A258297, A258298, A258299, A258300.
%K A258301 nonn
%O A258301 0,3
%A A258301 _Vaclav Kotesovec_, May 25 2015