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