Triangle read by rows: T(n,k) is the number of strongly connected oriented graphs on n unlabeled nodes with k arcs, n >= 1, k = 0..n*(n-1)/2.
A350750
Triangle read by rows: T(n,k) is the number of strongly connected oriented graphs on n unlabeled nodes with k arcs, n >= 1, k = 0..n*(n-1)/2.
Terms
- a(0) =1a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =1a(7) =0a(8) =0a(9) =0a(10) =0a(11) =1a(12) =2a(13) =1a(14) =0a(15) =0a(16) =0a(17) =0a(18) =0a(19) =1a(20) =5a(21) =18a(22) =27a(23) =19a(24) =6a(25) =0a(26) =0a(27) =0a(28) =0a(29) =0
External references
- oeis: A350750