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!)
A358781 Number of multiset partitions of [1,1,1,1,2,2,2,2,...,n,n,n,n] into nonempty multisets. 2
1, 5, 109, 6721, 911838, 231575143, 99003074679, 66106443797808, 65197274052335504, 90954424202936106523, 173398227073956386079670, 439196881673194611574668282, 1443741072199958276777413001395 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Generalization of Bell numbers to multiset partitions with m instances each of n different elements, here m=4.
REFERENCES
F. Harary and E. Palmer, Graphical Enumeration, Academic Press, 1973.
LINKS
Marko Riedel et al., Number of ways to partition a multiset into k non-empty multisets, Mathematics Stack Exchange.
CROSSREFS
Row n=4 of A219727.
Sequence in context: A012091 A322896 A296743 * A188457 A245106 A244004
KEYWORD
nonn
AUTHOR
Marko Riedel, Nov 29 2022
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 June 10 14:12 EDT 2023. Contains 363205 sequences. (Running on oeis4.)