... cannot insert n anywhere before the second -to- lastelement of p, since the last two elements of p either form a 12 pattern or a 21 pattern.Furthermore, the insertion of n into either the next -to- last ... least one of these) use the element n − 1.This shows that p contains a w−1C(u) pattern, completing this part of the proof. the electronic journal of combinatorics 9(2) (2003), #R6 11Therefore ... 231}), then the generating treeisomorphic to T ({132, 231}∪Q) that we constructed in Section 3 satisfies the hypotheses of Theorem 5.1: the ith component of d(a)isatleasttheith component of a,...