1. M. Bóna, Permutations with one or two 132-subsequences, Discr. Math.
2. M. Bóna, Permutations avoiding certain patterns; The case of length 4 and generalizations, Discr. Math.
3. P. Bose, J. F. Buss, A. Lubiw, Pattern matching for permutations, Proceedings, 3rd Workshop on Algorithms and Data Structures, 1993, 200, 209
4. Symmetric functions andP;Gessel;J. Combin. Theory Ser. A,1990
5. The number of permutations containing exactly one increasing subsequence of length 3;Noonan;Discr. Math.,1996