MathNet 2026 — Part 10 Question 189

Count the number of permutations $a_{1} a_{2} \ldots a_{7}$ of $1234567$ with longest decreasing subsequence of length at most two (i.e. there does not exist $i\lt j\lt k$ such that $a_{i}\gt a_{j}\gt a_{k}$ ).