Triangular array read by rows. T(n,k) is the number of labeled bipartite graphs on n nodes having exactly k connected components; n>=1, 1<=k<=n.

A228859

Triangular array read by rows. T(n,k) is the number of labeled bipartite graphs on n nodes having exactly k connected components; n>=1, 1<=k<=n.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =3a(4) =3a(5) =1a(6) =19a(7) =15a(8) =6a(9) =1a(10) =195a(11) =125a(12) =45a(13) =10a(14) =1a(15) =3031a(16) =1545a(17) =480a(18) =105a(19) =15a(20) =1a(21) =67263a(22) =27307a(23) =7035a(24) =1400a(25) =210a(26) =21a(27) =1a(28) =2086099a(29) =668367

External references