Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n).
A047874
Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =1a(6) =1a(7) =13a(8) =9a(9) =1a(10) =1a(11) =41a(12) =61a(13) =16a(14) =1a(15) =1a(16) =131a(17) =381a(18) =181a(19) =25a(20) =1a(21) =1a(22) =428a(23) =2332a(24) =1821a(25) =421a(26) =36a(27) =1a(28) =1a(29) =1429
External references
- oeis: A047874