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.

A319790 Number of non-isomorphic connected multiset partitions of weight n with empty intersection.

Original entry on oeis.org

1, 0, 0, 0, 1, 5, 32, 134, 588, 2335, 9335, 36506, 144263, 571238, 2291894, 9300462, 38303796, 160062325, 679333926, 2927951665, 12817221628, 56974693933, 257132512297, 1177882648846, 5475237760563, 25818721638720, 123473772356785, 598687942799298, 2942344764127039
Offset: 0

Views

Author

Gus Wiseman, Sep 27 2018

Keywords

Comments

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(4) = 1 through a(5) = 5 connected multiset partitions:
4:  {{1},{2},{1,2}}
5: {{1},{2},{1,2,2}}
   {{1},{1,2},{2,2}}
   {{2},{3},{1,2,3}}
   {{2},{1,3},{2,3}}
  {{1},{2},{2},{1,2}}
		

Crossrefs

Formula

a(n) = A007718(n) - A007716(n) + A317757(n). - Andrew Howroyd, May 31 2023

Extensions

Terms a(11) and beyond from Andrew Howroyd, May 31 2023