Triangular array giving number of bipartite graphs with n vertices, no isolated vertices and a distinguished bipartite block with k=1..n-1 vertices, up to isomorphism.

A056152

Triangular array giving number of bipartite graphs with n vertices, no isolated vertices and a distinguished bipartite block with k=1..n-1 vertices, up to isomorphism.

Terms

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

External references