Permutations which are the union of an increasing and a decreasing subsequence

Abstract

It is shown that there are ${2n\choose n}-\sum_{m=0}^{n-1}2^{n-m-1}{2m\choose m}$ permutations which are the union of an increasing sequence and a decreasing sequence.