This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A358781 #13 Dec 05 2022 08:15:00 %S A358781 1,5,109,6721,911838,231575143,99003074679,66106443797808, %T A358781 65197274052335504,90954424202936106523,173398227073956386079670, %U A358781 439196881673194611574668282,1443741072199958276777413001395 %N A358781 Number of multiset partitions of [1,1,1,1,2,2,2,2,...,n,n,n,n] into nonempty multisets. %C A358781 Generalization of Bell numbers to multiset partitions with m instances each of n different elements, here m=4. %D A358781 F. Harary and E. Palmer, Graphical Enumeration, Academic Press, 1973. %H A358781 Marko Riedel et al., <a href="https://math.stackexchange.com/questions/4585780/">Number of ways to partition a multiset into k non-empty multisets</a>, Mathematics Stack Exchange. %Y A358781 Cf. A358722, A020555, A322487. %Y A358781 Row n=4 of A219727. %K A358781 nonn %O A358781 0,2 %A A358781 _Marko Riedel_, Nov 29 2022