230896
domain: N
Appears in sequences
- Number of disconnected labeled graphs with n nodes.at n=7A054592
- Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes whose maximal connected component has at most k nodes, n>=1, 1<=k<=n.at n=26A275364
- Triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and cut-connectivity k.at n=28A327125
- Triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and vertex-connectivity k.at n=28A327334
- Accumulation triangle of A360603 read by rows.at n=34A360860