260494

Appears in sequences

• Number of graphs with n vertices such that a bipartite connected component doesn't exist.at n=9A157016
• a(0)=2, a(1)=3, a(n) = 3 + a(n-1) + a(n-2) for n >= 2.at n=23A171237
• 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=45A332964