login

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”).

A321680
Number of non-isomorphic weight-n connected antichains (not necessarily strict) of multisets with multiset density -1.
2
1, 1, 3, 4, 9, 14, 39, 80, 216, 538, 1460
OFFSET
0,3
COMMENTS
The multiset density of a multiset partition is the sum of the numbers of distinct vertices in each part minus the number of parts minus the number of vertices.
The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.
EXAMPLE
Non-isomorphic representatives of the a(1) = 1 through a(5) = 14 multiset trees:
{{1}} {{1,1}} {{1,1,1}} {{1,1,1,1}} {{1,1,1,1,1}}
{{1,2}} {{1,2,2}} {{1,1,2,2}} {{1,1,2,2,2}}
{{1},{1}} {{1,2,3}} {{1,2,2,2}} {{1,2,2,2,2}}
{{1},{1},{1}} {{1,2,3,3}} {{1,2,2,3,3}}
{{1,2,3,4}} {{1,2,3,3,3}}
{{1,1},{1,1}} {{1,2,3,4,4}}
{{1,2},{2,2}} {{1,2,3,4,5}}
{{1,3},{2,3}} {{1,1},{1,2,2}}
{{1},{1},{1},{1}} {{1,2},{2,2,2}}
{{1,2},{2,3,3}}
{{1,3},{2,3,3}}
{{1,4},{2,3,4}}
{{3,3},{1,2,3}}
{{1},{1},{1},{1},{1}}
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Nov 16 2018
STATUS
approved