cp's OEIS Frontend

A360038 Triangle read by rows. Number T(n, k) of partitions of the multiset [1, 1, 1, 1, 2, 2, 2, 2, ..., n, n, n, n] into k nonempty subsets, for 4 <= k <= 4n.

%I A360038 #15 Jan 25 2023 16:26:47
%S A360038 1,1,1,1,1,1,1,4,11,19,22,13,7,3,1,1,14,117,445,873,1002,805,483,226,
%T A360038 81,25,6,1,1,51,1387,12567,47986,96620,120970,104942,67901,34385,
%U A360038 14150,4817,1371,325,65,10,1,1,201,18171,396571,3053216,11003801,22360580,29114463,26607981,18227245,9816458,4301588,1572206,487670,129880,29828,5901,995,140,15,1
%N A360038 Triangle read by rows. Number T(n, k) of partitions of the multiset [1, 1, 1, 1, 2, 2, 2, 2, ..., n, n, n, n] into k nonempty subsets, for 4 <= k <= 4n.
%C A360038 A generalization of ordinary Stirling set numbers to multisets that contain some m instances each of n elements, here we have m=4.
%D A360038 F. Harary and E. Palmer, Graphical Enumeration, Academic Press, 1973.
%H A360038 Marko Riedel, <a href="/A360038/b360038.txt">Rows 1 to 9 of triangle, flattened.</a>
%e A360038 The triangular array starts:
%e A360038 [1]: 1;
%e A360038 [2]: 1,  1,   1,   1,   1;
%e A360038 [3]: 1,  4,  11,  19,  22,   13,   7,   3,   1;
%e A360038 [4]: 1, 14, 117, 445, 873, 1002, 805, 483, 226, 81, 25, 6, 1;
%Y A360038 Cf. A098233, A360037, A360039, A165435 (row sums).
%K A360038 nonn,tabf
%O A360038 1,8
%A A360038 _Marko Riedel_, Jan 22 2023