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

A350732

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

Terms

    a(0) =1a(1) =0a(2) =2a(3) =0a(4) =0a(5) =12a(6) =8a(7) =0a(8) =0a(9) =0a(10) =128a(11) =240a(12) =192a(13) =64a(14) =0a(15) =0a(16) =0a(17) =0a(18) =2000a(19) =7104a(20) =13120a(21) =15360a(22) =11520a(23) =5120a(24) =1024a(25) =0a(26) =0a(27) =0a(28) =0a(29) =0

External references