12007355

Appears in sequences

• Triangle read by rows: T(n,m) = number of unlabeled graphs on n nodes with m connected components, m = 1,2,...,n.at n=56A201922
• Number of unlabeled graphs on n nodes that have exactly two non-isomorphic components.at n=10A216785
• 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=26A217955
• Number of unlabeled graphs with n nodes that have two components, neither of which is the empty graph.at n=11A274934