Counting permutations by their runs up and down
Canfield, E. Rodney · Wilf, Herbert S.
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.