A321134 Number of uniform hypergraphs spanning n vertices where every two vertices appear together in some edge.
1, 1, 1, 2, 7, 406, 505635
Offset: 0
Examples
The a(4) = 7 hypergraphs:
{{1,2,3,4}}
{{1,2,3},{1,2,4},{1,3,4}}
{{1,2,3},{1,2,4},{2,3,4}}
{{1,2,3},{1,3,4},{2,3,4}}
{{1,2,4},{1,3,4},{2,3,4}}
{{1,2,3},{1,2,4},{1,3,4},{2,3,4}}
{{1,2},{1,3},{1,4},{2,3},{2,4},{3,4}}
Programs
-
Mathematica
Table[Sum[Length[Select[Subsets[Subsets[Range[n],{k}]],And[Union@@#==Range[n],Length[Union@@(Subsets[#,{2}]&/@#)]==Binomial[n,2]]&]],{k,1,n}],{n,1,6}]
Comments