Counting occurrences of 132 in a permutation

Research output: Contribution to journalArticlepeer-review


We study the generating function for the number of permutations on n letters containing exactly r ≥ 0 occurrences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in S2r.

Original languageEnglish
Pages (from-to)185-195
Number of pages11
JournalAdvances in Applied Mathematics
Issue number2
StatePublished - 2002

ASJC Scopus subject areas

  • Applied Mathematics


Dive into the research topics of 'Counting occurrences of 132 in a permutation'. Together they form a unique fingerprint.

Cite this