Counting permutations by their runs up and down
  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. 
E. Rodney Canfield (University of Georgia) and Herbert S. Wilf   (University of Pennsylvania)