Counting permutations by their alternating runs

We find a formula for the number of permutations of [ n ] that have exactly s runs up and down. The formula is at once terminating, asymptotic, and exact. The asymptotic series is valid for n → ∞ , uniformly for s ⩽ ( 1 − ϵ ) n / log n ( ϵ > 0 ).