Triangle read by rows: T(n,k) = number of heapable permutations of length n whose longest decreasing subsequence has length k.
A390146
Triangle read by rows: T(n,k) = number of heapable permutations of length n whose longest decreasing subsequence has length k.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =4a(6) =1a(7) =13a(8) =3a(9) =1a(10) =41a(11) =29a(12) =1a(13) =131a(14) =206a(15) =21a(16) =1a(17) =428a(18) =1332a(19) =365a(20) =1a(21) =1429a(22) =8380a(23) =4437a(24) =248a(25) =1a(26) =4861a(27) =52705a(28) =47515a(29) =6839
External references
- oeis: A390146