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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Dec 08 2020 08:04:31
%S 1,1,1,4,11,41,154,904,4927,35398,234454,1965976,16589885,157974740,
%T 1480736877,16406078770,177232251249,2151696598160,25726133391191,
%U 346746928400037,4607758596471426,67562340652906942,969200312705046531,15386051753617360150
%N Number of n-times strict partitions of n.
%H Alois P. Heinz, <a href="/A306188/b306188.txt">Table of n, a(n) for n = 0..480</a>
%p b:= proc(n, i, k) option remember; `if`(i*(i+1)/2<n, 0, `if`(n=0 or
%p k=0, 1, b(n, i-1, k)+b(i$2, k-1)*b(n-i, min(n-i, i-1), k)))
%p end:
%p a:= n-> b(n$3):
%p seq(a(n), n=0..25);
%t b[n_, i_, k_] := b[n, i, k] = If[i(i+1)/2 < n, 0, If[n == 0 || k == 0, 1, b[n, i - 1, k] + b[i, i, k - 1] b[n - i, Min[n - i, i - 1], k]]];
%t a[n_] := b[n, n, n];
%t a /@ Range[0, 25] (* _Jean-François Alcover_, Dec 08 2020, after _Alois P. Heinz_ *)
%Y Cf. A000009, A261280, A306187.
%K nonn
%O 0,4
%A _Alois P. Heinz_, Jan 27 2019