[go: up one dir, main page]

login
A319190
Number of regular hypergraphs spanning n vertices.
20
1, 1, 3, 19, 879, 5280907, 1069418570520767
OFFSET
0,3
COMMENTS
We define a hypergraph to be any finite set of finite nonempty sets. A hypergraph is regular if all vertices have the same degree. The span of a hypergraph is the union of its edges.
EXAMPLE
The a(3) = 19 regular hypergraphs:
{{1,2,3}}
{{1},{2,3}}
{{2},{1,3}}
{{3},{1,2}}
{{1},{2},{3}}
{{1},{2,3},{1,2,3}}
{{2},{1,3},{1,2,3}}
{{3},{1,2},{1,2,3}}
{{1,2},{1,3},{2,3}}
{{1},{2},{3},{1,2,3}}
{{1},{2},{1,3},{2,3}}
{{1},{3},{1,2},{2,3}}
{{2},{3},{1,2},{1,3}}
{{1,2},{1,3},{2,3},{1,2,3}}
{{1},{2},{1,3},{2,3},{1,2,3}}
{{1},{3},{1,2},{2,3},{1,2,3}}
{{2},{3},{1,2},{1,3},{1,2,3}}
{{1},{2},{3},{1,2},{1,3},{2,3}}
{{1},{2},{3},{1,2},{1,3},{2,3},{1,2,3}}
MATHEMATICA
Table[Sum[SeriesCoefficient[Product[1+Times@@x/@s, {s, Subsets[Range[n], {1, n}]}], Sequence@@Table[{x[i], 0, k}, {i, n}]], {k, 1, 2^n}], {n, 5}]
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Dec 17 2018
EXTENSIONS
a(6) from Andrew Howroyd, Mar 12 2020
STATUS
approved