Triangle read by rows: T(n,k) (n>=1; 1<=k<=n) is the number of permutations of [n] in which the longest increasing run has length k.
A008304
Triangle read by rows: T(n,k) (n>=1; 1<=k<=n) is the number of permutations of [n] in which the longest increasing run has length k.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =1a(6) =1a(7) =16a(8) =6a(9) =1a(10) =1a(11) =69a(12) =41a(13) =8a(14) =1a(15) =1a(16) =348a(17) =293a(18) =67a(19) =10a(20) =1a(21) =1a(22) =2016a(23) =2309a(24) =602a(25) =99a(26) =12a(27) =1a(28) =1a(29) =13357
External references
- oeis: A008304