Counting occurrences of 231 in an involution

We study the generating function for the number of involutions on n   letters containing exactly r⩾0r⩾0 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 2r+22r+2.