Counting occurrences of 132 in an even permutation

Abstract

We study the generating function for the number of even (or odd) permutations on n letters containing exactly r\gs0 occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in $S_{2r}$.Comment: 12 pages, 2 figure