Counting occurrences of 3412 in an involution

We study the generating function for the number of involutions on $n$ letters containing exactly $r\text{gs}0$ occurrences of 3412. It is shown that finding this function for a given $r$ amounts to a routine check of all involutions on $2r+1$ letters.