Restricted 132-avoiding k-ary words, Chebyshev polynomials, and continued fractions

We study generating functions for the number of n-long k-ary words that avoid both 132 and an arbitrary ℓ-ary pattern. In several interesting cases the generating function depends only on ℓ and is expressed via Chebyshev polynomials of the second kind and continued fractions.