Irregular triangular array read by rows. T(n,k) is the number of connected labeled bipartite graphs on n nodes with exactly k edges; n >= 1, 0 <= k <= A002620(n+1).
A228861
Irregular triangular array read by rows. T(n,k) is the number of connected labeled bipartite graphs on n nodes with exactly k edges; n >= 1, 0 <= k <= A002620(n+1).
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =3a(6) =0a(7) =0a(8) =0a(9) =16a(10) =3a(11) =0a(12) =0a(13) =0a(14) =0a(15) =125a(16) =60a(17) =10a(18) =0a(19) =0a(20) =0a(21) =0a(22) =0a(23) =1296a(24) =1140a(25) =480a(26) =105a(27) =10a(28) =0a(29) =0
External references
- oeis: A228861