The generating function Fr(x) that counts the involutions on n letters containing exactly r pairs of intersecting arcs in theirgraphical representation is studied. More precisely, an algorithm that computes the generating function Fr(x) for any givenr ≥ 0 is presented. To derive the result for a given r, the algorithm performs certain routine checks on involutions of length2r + 2 without fixed points. The algorithm is implemented in Maple and yields explicit formulas for 0 ≤ r ≤ 4.