Triangle read by rows: T(n,k) is the number of weakly connected acyclic digraphs on n labeled nodes with k arcs, k=0..n*(n-1).

A350909

Triangle read by rows: T(n,k) is the number of weakly connected acyclic digraphs on n labeled nodes with k arcs, k=0..n*(n-1).

Terms

    a(0) =1a(1) =0a(2) =2a(3) =0a(4) =0a(5) =12a(6) =6a(7) =0a(8) =0a(9) =0a(10) =128a(11) =186a(12) =108a(13) =24a(14) =0a(15) =0a(16) =0a(17) =0a(18) =2000a(19) =5640a(20) =7840a(21) =6540a(22) =3330a(23) =960a(24) =120a(25) =0a(26) =0a(27) =0a(28) =0a(29) =0

External references