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

A350449

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

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =3a(6) =1a(7) =0a(8) =0a(9) =0a(10) =8a(11) =9a(12) =6a(13) =1a(14) =0a(15) =0a(16) =0a(17) =0a(18) =27a(19) =54a(20) =79a(21) =63a(22) =33a(23) =10a(24) =1a(25) =0a(26) =0a(27) =0a(28) =0a(29) =0

External references