Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Nov 08 2016 07:36:24
%S 0,1,3,9,39,201,1227,8305,61383,487761,4131819,37072361,350644047,
%T 3482957945,36220558835,393329507169,4450157382383,52354044069009,
%U 639307054297779,8090092395577625,105935581968131399,1433456549698679385,20018656224312123051
%N Indecomposable collections of multisets with a total of n objects having entries {1,2,...,k} for some k<=n or INVERTi transform of A255906.
%C A multiset partition of a multiset S is a set of nonempty multisets whose union is S. The total number of multisets of size n and whose entries have all the values in {1,2,...,k} for some k<=n is given by sequence A255906. A multiset partition is decomposable if there exists a value 1<=d<k such that every multiset A in the multiset partition either has max(A)<=d or min(A)>d. A multiset partition is called indecomposable otherwise.
%D P. A. MacMahon, Combinatory Analysis, vol 1, Cambridge, 1915.
%H Alois P. Heinz, <a href="/A273396/b273396.txt">Table of n, a(n) for n = 0..300</a>
%H R. Orellana, M. Zabrocki, <a href="http://arxiv.org/abs/1605.06672">Symmetric group characters as symmetric functions</a>, arXiv:1605.06672 [math.CO], 2016; or <a href="http://arxiv.org/abs/1510.00438">extended abstract</a>, arXiv:1510.00438 [math.CO], 2015.
%e a(3) = 9 because there are 16 multiset partitions, 9 of them are indecomposable ({{1},{1},{1}}, {{1},{1,1}}, {{1,1,1}}, {{1},{1,2}}, {{2},{1,2}}, {{1,1,2}}, {{1,2,2}}, {{2},{1,3}}, {{1,2,3}}) and 7 are decomposable ({{1},{1},{2}}, {{1},{2},{2}}, {{1},{2,2}}, {{2},{1,1}}, {{1},{2},{3}}, {{1},{2,3}}, {{3},{1,2}}).
%Y Cf. A074664, A003319.
%Y INVERTi transform of A255906.
%K nonn
%O 0,3
%A _Mike Zabrocki_, May 21 2016