Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three

This publication has 13 references indexed in Scilit:

• Counting Occurrences of 132 in a Permutation
  Advances in Applied Mathematics, 2002
• Permutations Restricted by Two Distinct Patterns of Length Three
  Advances in Applied Mathematics, 2001
• Permutations with Restricted Patterns and Dyck Paths
  Advances in Applied Mathematics, 2001
• Permutations with one or two 132-subsequences
  Discrete Mathematics, 1998
• Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps
  Journal of Combinatorial Theory, Series A, 1997
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
  Discrete Mathematics, 1997
• The Number of Permutations with Exactlyr132-Subsequences IsP-Recursive in the Size!
  Advances in Applied Mathematics, 1997
• The Enumeration of Permutations with a Prescribed Number of “Forbidden” Patterns
  Advances in Applied Mathematics, 1996
• The number of permutations containing exactly one increasing subsequence of length three
  Discrete Mathematics, 1996
• Restricted Permutations
  European Journal of Combinatorics, 1985