Triangular array T(n,k) giving number of weakly connected digraphs with n labeled nodes and k arcs (n >= 1, 0 <= k <= n(n-1)).

A062735

Triangular array T(n,k) giving number of weakly connected digraphs with n labeled nodes and k arcs (n >= 1, 0 <= k <= n(n-1)).

Terms

    a(0) =1a(1) =0a(2) =2a(3) =1a(4) =0a(5) =0a(6) =12a(7) =20a(8) =15a(9) =6a(10) =1a(11) =0a(12) =0a(13) =0a(14) =128a(15) =432a(16) =768a(17) =920a(18) =792a(19) =495a(20) =220a(21) =66a(22) =12a(23) =1a(24) =0a(25) =0a(26) =0a(27) =0a(28) =2000a(29) =11104

External references