  In this paper, we introduce a new method for computing generating functions
with respect to the number of descents and left-to-right minima over the set of
permutations which have no consecutive occurrences of a pattern that starts
with 1.

Combinatorics