The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A327509 Number of set partitions of [n] where each subset is again partitioned into eight nonempty subsets. 2
1, 0, 0, 0, 0, 0, 0, 0, 1, 36, 750, 11880, 159027, 1899612, 20912320, 216627840, 2141770488, 20416870188, 189100389270, 1713143123640, 15314761051669, 137723007972924, 1310008783707360, 14647748873844240, 215375952901752225, 4079250159907459680 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,10
LINKS
FORMULA
E.g.f.: exp((exp(x)-1)^8/8!).
a(n) = Sum_{k=0..floor(n/8)} (8*k)! * Stirling2(n,8*k)/(8!^k * k!). - Seiichi Manyama, May 07 2022
MAPLE
a:= proc(n) option remember; `if`(n=0, 1, add(a(n-j)
*binomial(n-1, j-1)*Stirling2(j, 8), j=8..n))
end:
seq(a(n), n=0..27);
PROG
(PARI) a(n) = sum(k=0, n\8, (8*k)!*stirling(n, 8*k, 2)/(8!^k*k!)); \\ Seiichi Manyama, May 07 2022
CROSSREFS
Column k=8 of A324162.
Sequence in context: A004329 A089909 A049434 * A215768 A320821 A144941
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Sep 14 2019
STATUS
approved

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 May 16 10:52 EDT 2024. Contains 372552 sequences. (Running on oeis4.)