Triangle T(n,k) of the number of strongly connected digraphs on n labeled nodes and with k arcs, k=0..n*(n-1).

A057273

Triangle T(n,k) of the number of strongly connected digraphs on n labeled nodes and with k arcs, k=0..n*(n-1).

Terms

    a(0) =1a(1) =0a(2) =0a(3) =1a(4) =0a(5) =0a(6) =0a(7) =2a(8) =9a(9) =6a(10) =1a(11) =0a(12) =0a(13) =0a(14) =0a(15) =6a(16) =84a(17) =316a(18) =492a(19) =417a(20) =212a(21) =66a(22) =12a(23) =1a(24) =0a(25) =0a(26) =0a(27) =0a(28) =0a(29) =24

External references