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.

A332964

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.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =1a(7) =1a(8) =1a(9) =1a(10) =3a(11) =4a(12) =2a(13) =1a(14) =1a(15) =16a(16) =9a(17) =5a(18) =2a(19) =1a(20) =1a(21) =96a(22) =37a(23) =13a(24) =6a(25) =2a(26) =1a(27) =1a(28) =812a(29) =162

External references