A309895 Number of floor(n/2)-uniform hypergraphs on n unlabeled nodes.

2, 2, 3, 4, 11, 34, 2136, 7013320, 29281354514767168, 234431745534048922731115555415680, 1994324729203114587259985605157804740271034553359179870979936357974016

Offset: 0

Author

Alois P. Heinz, Aug 21 2019

Keywords

• nonn

Comments

A hypergraph is called k-uniform if all hyperedges have the same cardinality k.

Links

• Alois P. Heinz, Table of n, a(n) for n = 0..14
• Wikipedia, Hypergraph

Crossrefs

Cf. A309858, A309865.

Formula

a(n) = A309858(n,floor(n/2)) = A309865(n,floor(n/2)).