Restricted even permutations and Chebyshev polynomials

We study generating functions for the number of even (odd) permutations on n   letters avoiding 132 and an arbitrary permutation ττ on k   letters, or containing ττ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.