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

A350914

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

Terms

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

External references