Triangle read by rows: T(n,k) is the number of unlabeled connected graphs with n nodes and bipartite dimension (or biclique covering number) k, 0 <= k < n.

A355335

Triangle read by rows: T(n,k) is the number of unlabeled connected graphs with n nodes and bipartite dimension (or biclique covering number) k, 0 <= k < n.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =2a(8) =4a(9) =0a(10) =0a(11) =2a(12) =13a(13) =6a(14) =0a(15) =0a(16) =3a(17) =38a(18) =67a(19) =4a(20) =0a(21) =0a(22) =3a(23) =94a(24) =550a(25) =205a(26) =1a(27) =0a(28) =0a(29) =4

External references