login
A309895
Number of floor(n/2)-uniform hypergraphs on n unlabeled nodes.
1
2, 2, 3, 4, 11, 34, 2136, 7013320, 29281354514767168, 234431745534048922731115555415680, 1994324729203114587259985605157804740271034553359179870979936357974016
OFFSET
0,1
COMMENTS
A hypergraph is called k-uniform if all hyperedges have the same cardinality k.
LINKS
Wikipedia, Hypergraph
FORMULA
a(n) = A309858(n,floor(n/2)) = A309865(n,floor(n/2)).
CROSSREFS
Sequence in context: A205118 A363745 A022405 * A361246 A375791 A270744
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Aug 21 2019
STATUS
approved