Stack-Sortable Permutations and Catalan Numbers

Push $1\dots n$ in order and pop at will: the reachable output orders are exactly the 231-avoiding permutations, and there are $C_n = \binom{2n}{n}/(n+1)$ of them.