Triangle read by rows: T(n,k) is the number of unlabeled weakly connected acyclic digraphs with n arcs and k vertices, n >= 0, k = 1..n+1.

A350450

Triangle read by rows: T(n,k) is the number of unlabeled weakly connected acyclic digraphs with n arcs and k vertices, n >= 0, k = 1..n+1.

Terms

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

External references