A327509 - OEIS

%I #8 May 08 2022 08:24:14

%S 1,0,0,0,0,0,0,0,1,36,750,11880,159027,1899612,20912320,216627840,

%T 2141770488,20416870188,189100389270,1713143123640,15314761051669,

%U 137723007972924,1310008783707360,14647748873844240,215375952901752225,4079250159907459680

%N Number of set partitions of [n] where each subset is again partitioned into eight nonempty subsets.

%H Alois P. Heinz, <a href="/A327509/b327509.txt">Table of n, a(n) for n = 0..498</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>

%F E.g.f.: exp((exp(x)-1)^8/8!).

%F a(n) = Sum_{k=0..floor(n/8)} (8*k)! * Stirling2(n,8*k)/(8!^k * k!). - _Seiichi Manyama_, May 07 2022

%p a:= proc(n) option remember; `if`(n=0, 1, add(a(n-j)

%p       *binomial(n-1, j-1)*Stirling2(j, 8), j=8..n))

%p     end:

%p seq(a(n), n=0..27);

%o (PARI) a(n) = sum(k=0, n\8, (8*k)!*stirling(n, 8*k, 2)/(8!^k*k!)); \\ _Seiichi Manyama_, May 07 2022

%Y Column k=8 of A324162.

%K nonn

%O 0,10

%A _Alois P. Heinz_, Sep 14 2019