login
Number of unlabeled uniform connected hypergraphs spanning n vertices.
5

%I #16 Aug 27 2019 10:44:07

%S 1,1,1,3,10,55,2369,14026242,29284932065996223,

%T 468863491068204425232922367146585,

%U 1994324729204021501147398087008429476673379600542622915802043455294332

%N Number of unlabeled uniform connected hypergraphs spanning n vertices.

%C A hypergraph is uniform if all edges have the same size.

%H Andrew Howroyd, <a href="/A301920/b301920.txt">Table of n, a(n) for n = 0..13</a>

%e Non-isomorphic representatives of the a(4) = 10 hypergraphs:

%e {{1,2,3,4}}

%e {{1,3,4},{2,3,4}}

%e {{1,3},{2,4},{3,4}}

%e {{1,4},{2,4},{3,4}}

%e {{1,2,4},{1,3,4},{2,3,4}}

%e {{1,2},{1,3},{2,4},{3,4}}

%e {{1,4},{2,3},{2,4},{3,4}}

%e {{1,3},{1,4},{2,3},{2,4},{3,4}}

%e {{1,2,3},{1,2,4},{1,3,4},{2,3,4}}

%e {{1,2},{1,3},{1,4},{2,3},{2,4},{3,4}}

%Y Row sums of A301924.

%Y Cf. A003465, A006129, A038041, A055621, A298422, A299353, A299354, A301481, A306017-A306021.

%K nonn

%O 0,4

%A _Gus Wiseman_, Jun 19 2018

%E Terms a(6) and beyond from _Andrew Howroyd_, Aug 26 2019