Number of connected bipartite graphs with n edges, no isolated vertices and a distinguished bipartite block, up to isomorphism.

A056156

Number of connected bipartite graphs with n edges, no isolated vertices and a distinguished bipartite block, up to isomorphism.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =7a(4) =12a(5) =32a(6) =67a(7) =181a(8) =458a(9) =1295a(10) =3642a(11) =10975a(12) =33448a(13) =106424a(14) =345964a(15) =1159489a(16) =3975367a(17) =13977808a(18) =50238606a(19) =184629655a(20) =692757132a(21) =2652892219a(22) =10359676617a(23) =41233344350a(24) =167171988557a(25) =690054189750

External references