|
%I #9 Dec 11 2020 07:58:01
%S 1,4,55,1540,67375,4239235,383563180,51925673800,10652498631775,
%T 3139051466175625,1228555090548911125,602267334323068414000,
%U 357161594247065690582500,250870551734754490461422500,205672479804595549379158525000,194557626586812183102927448930000
%N Number of set partitions of [3n] with minimal block length multiplicity equal to n.
%H Alois P. Heinz, <a href="/A271715/b271715.txt">Table of n, a(n) for n = 0..200</a>
%F a(n) = A271424(3n,n).
%F Recursion: see Maple program.
%F For n>0, a(n) = (3^n + n!)*(3*n)! / (6^n * (n!)^2). - _Vaclav Kotesovec_, Apr 16 2016
%p a:= proc(n) option remember; `if`(n<5,
%p [1, 4, 55, 1540, 67375][n+1], ((2*(3*n-2))*
%p (3*n-1)*(n^2-n-9)*a(n-1) -(3*(n-3))*(3*n-1)*
%p (3*n-4)*(3*n-2)*(3*n-5)*a(n-2))/(4*n*(n-4)))
%p end:
%p seq(a(n), n=0..20);
%t multinomial[n_, k_List] := n!/Times @@ (k!);
%t b[n_, i_, k_] := b[n, i, k] = If[n==0, 1, If[i<1, 0, Sum[multinomial[n, Join[{n - i*j}, Array[i&, j]]]*b[n - i*j, i - 1, k]/j!, {j, Join[{0}, Range[k, n/i]] // Union}]]];
%t a[n_] := If[n==0, 1, b[3n, 3n, n] - b[3n, 3n, n+1]];
%t a /@ Range[0, 20] (* _Jean-François Alcover_, Dec 11 2020, after _Alois P. Heinz_ in A271424 *)
%Y Cf. A271424.
%K nonn
%O 0,2
%A _Alois P. Heinz_, Apr 12 2016
|
