T(n,k) is the number of permutations of [n] with maximum descent k, T(n,k) for n >= 0 and 0 <= k <= n, triangle read by rows.
A130477
T(n,k) is the number of permutations of [n] with maximum descent k, T(n,k) for n >= 0 and 0 <= k <= n, triangle read by rows.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =3a(6) =1a(7) =3a(8) =8a(9) =12a(10) =1a(11) =4a(12) =15a(13) =40a(14) =60a(15) =1a(16) =5a(17) =24a(18) =90a(19) =240a(20) =360a(21) =1a(22) =6a(23) =35a(24) =168a(25) =630a(26) =1680a(27) =2520a(28) =1a(29) =7
External references
- oeis: A130477