The Unimodal Permutation Count
Combinatorics · 26th PMO Qualifying Stage
A finite sequence $a_1, a_2, \ldots, a_n$, with $n\ge 3$, is said to be strongly unimodal if there exists an integer $k$, with $1<k<n$, such that $a_1<\cdots<a_k>a_{k+1}>\cdots>a_n$. How many strongly unimodal sequences $a_1,\ldots,a_{26}$ are there which are permutations of the set $\{1,2,\ldots,26\}$?
A$2^{25}-2$
B$2^{25}-1$
C$2^{26}-2$
D$2^{26}-1$