cp's OEIS Frontend

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.

A319763 Number of non-isomorphic strict intersecting multiset partitions (sets of multisets) of weight n with empty intersection.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 1, 2, 12, 46, 181
Offset: 0

Views

Author

Gus Wiseman, Sep 27 2018

Keywords

Comments

A multiset partition is intersecting if no two parts are disjoint. The weight of a multiset partition is the sum of sizes of its parts. Weight is generally not the same as number of vertices.

Examples

			Non-isomorphic representatives of the a(6) = 1 through a(8) = 12 multiset partitions:
6: {{1,2},{1,3},{2,3}}
7: {{1,2},{1,3},{2,3,3}}
   {{1,3},{1,4},{2,3,4}}
8: {{1,2},{1,3},{2,2,3,3}}
   {{1,2},{1,3},{2,3,3,3}}
   {{1,2},{1,3},{2,3,4,4}}
   {{1,2},{1,3,3},{2,3,3}}
   {{1,2},{1,3,4},{2,3,4}}
   {{1,3},{1,4},{2,3,4,4}}
   {{1,3},{1,1,2},{2,3,3}}
   {{1,3},{1,2,2},{2,3,3}}
   {{1,4},{1,5},{2,3,4,5}}
   {{2,3},{1,2,4},{3,4,4}}
   {{2,4},{1,2,3},{3,4,4}}
   {{2,4},{1,2,5},{3,4,5}}
		

Crossrefs