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

A057276

Triangle T(n,k) of number of strongly connected digraphs on n unlabeled 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) =1a(8) =2a(9) =1a(10) =1a(11) =0a(12) =0a(13) =0a(14) =0a(15) =1a(16) =4a(17) =16a(18) =22a(19) =22a(20) =11a(21) =5a(22) =1a(23) =1a(24) =0a(25) =0a(26) =0a(27) =0a(28) =0a(29) =1

External references