2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/61441We study the generating function for the number of permutations on n letters containing exactly $r\gs0$ occurences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in $S_{2r}$.9 pages, 2 figuresCombinatorics05A05; 05A15; 05C90text