66296291072
domain: N
Appears in sequences
- Number of connected labeled graphs with n nodes.at n=9A001187
- Triangle read by rows: T(n,k) = number of labeled graphs on n nodes with k connected components, 1<=k<=n.at n=36A143543
- Triangular array read by rows. T(n,k) is the number of simple labeled graphs on n nodes with no isolated nodes and exactly k components. n >= 2, 1 <= k < n/2.at n=16A218334
- Triangular array read by rows: T(n,k) is the number of connected components with size k summed over all simple labeled graphs on n nodes; n>=1, 1<=k<=n.at n=44A223894
- Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n vertices, n>=1, with exactly k connected components, 1<=k<=n, such that the vertices labeled with 1,2,...,k are all in different components.at n=36A275595
- Regular triangle where T(n,k) is the number of labeled connected k-uniform hypergraphs spanning n vertices.at n=37A299354
- Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where column k is the expansion of e.g.f. log(Sum_{j>=0} k^binomial(j,2) * x^j/j!).at n=53A308460