A combinatorial proof of a result of Gessel and Greene

A combinatorial proof is given of a result of Gessel and Greene relating the sizes of two classes of permutations. A natural map from one class to the other is described in terms of a shared recursive structure.