A square involution is a square permutation which is also an involution. The authors prove that the number of square involutions of length \(n\) is \[ (n+2)2^{n-3}-(n-2)\binom{n-3}{\lfloor \frac{n-3}{2}\rfloor},n\geq 3. \]