Number of "hyperforests" on n labeled nodes, i.e., hypergraphs that have no cycles, assuming that each edge contains at least two vertices.
A134954
Number of "hyperforests" on n labeled nodes, i.e., hypergraphs that have no cycles, assuming that each edge contains at least two vertices.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =8a(4) =55a(5) =562a(6) =7739a(7) =134808a(8) =2846764a(9) =70720278a(10) =2021462055a(11) =65365925308
External references
- oeis: A134954