Counting occurrences of 132 in a permutation (Q696855): Difference between revisions

Let \(\tau\) be a fixed permutation of length \(m\). Let \(\psi^\tau_r(n)\) denote the number of permutations of length \(n\) containing a given number \(r\geq 0\) of occurrences of \(\tau\). \textit{M. Bóna} [Discrete Math. 181, 267-274 (1998; Zbl 0896.05004)] proved that \[ \psi^{132}_1(n)= {2n-3\choose n-3}. \] In this paper the authors present an algorithm to compute for any \(r\geq 0\) the generating function \(\sum_{n\geq 0} \psi^{132}_r(n) x^n\).