Irregular triangle read by rows: T(n,k) (n>=2, k>=1) = number of strong tournaments on n nodes with k descents.
A339590
Irregular triangle read by rows: T(n,k) (n>=2, k>=1) = number of strong tournaments on n nodes with k descents.
Terms
- a(0) =0a(1) =1a(2) =1a(3) =1a(4) =6a(5) =10a(6) =6a(7) =1a(8) =1a(9) =13a(10) =56a(11) =123a(12) =158a(13) =123a(14) =56a(15) =13a(16) =1a(17) =1a(18) =22a(19) =172a(20) =717a(21) =1910a(22) =3547a(23) =4791a(24) =4791a(25) =3547a(26) =1910a(27) =717a(28) =172a(29) =22
External references
- oeis: A339590