Counting occurrences of 231 in an involution Original Research Article

We study the generating function for the number of involutions on n letters containing exactly image occurrences of 231. It is shown that finding this function for a given r amounts to a routine check of all involutions of length at most image.