Triangle read by rows: T(n,k) (n>=1, 0<=k<n) is the number of permutations of n things that require k stack-sorts.
A262494
Triangle read by rows: T(n,k) (n>=1, 0<=k<n) is the number of permutations of n things that require k stack-sorts.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =1a(6) =1a(7) =13a(8) =8a(9) =2a(10) =1a(11) =41a(12) =49a(13) =23a(14) =6a(15) =1a(16) =131a(17) =276a(18) =198a(19) =90a(20) =24a(21) =1a(22) =428a(23) =1509a(24) =1556a(25) =982a(26) =444a(27) =120a(28) =1a(29) =1429
External references
- oeis: A262494