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