165091859656
domain: N
Appears in sequences
- Number of unlabeled graphs on n nodes that have exactly two non-isomorphic components.at n=12A216785
- Triangular array read by rows. T(n,k) is the number of unlabeled graphs on n nodes that have exactly k distinct components (n >= 1).at n=34A217955
- Number of unlabeled graphs with n nodes that have two components, neither of which is the empty graph.at n=13A274934