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