Triangle read by rows: T(n,k) = number of labeled digraphs with n nodes and k arcs and without directed paths of length >=2, with 0 <= k <= floor(n^2/4).
A052296
Triangle read by rows: T(n,k) = number of labeled digraphs with n nodes and k arcs and without directed paths of length >=2, with 0 <= k <= floor(n^2/4).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =6a(6) =6a(7) =1a(8) =12a(9) =36a(10) =32a(11) =6a(12) =1a(13) =20a(14) =120a(15) =280a(16) =280a(17) =120a(18) =20a(19) =1a(20) =30a(21) =300a(22) =1320a(23) =2910a(24) =3492a(25) =2400a(26) =960a(27) =210a(28) =20a(29) =1
External references
- oeis: A052296