Number of labeled spanning trees in the complete hypergraph on n vertices (all hyperedges having cardinality 2 or greater).
A030019
Number of labeled spanning trees in the complete hypergraph on n vertices (all hyperedges having cardinality 2 or greater).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =4a(4) =29a(5) =311a(6) =4447a(7) =79745a(8) =1722681a(9) =43578820a(10) =1264185051a(11) =41381702275
External references
- oeis: A030019