11713772

Appears in sequences

• Number of graphs with n vertices such that a bipartite connected component doesn't exist.at n=10A157016
• Triangle read by rows: T(n,k) is the number of unlabeled simple graphs on n nodes with exactly k bipartite connected components, n >= 0, 0 <= k <= n.at n=55A332964