| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4625330 | Advances in Applied Mathematics | 2006 | 19 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
