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

A350447

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

Terms

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

External references