published by Rod Canfield
in 2006
and research's language is
English
Download
Abstract in English
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.