2147156736
domain: N
Appears in sequences
- Number of connected hypergraphs (without multiple edges and without empty edges) on n labeled vertices.at n=4A092918
- Triangle read by rows: T(n,k) is the number of hypergraphs on n labeled vertices with exactly k connected components, n>=1, 1<=k<=n.at n=10A285616
- Number of connected set-systems covering n vertices.at n=5A323818