What a Proof Is · Superchallenge problem

A proof claims $\gcd\big(n^2 + 3,\ (n + 1)^2 + 3\big) = 1$ for every positive integer $n$. It is wrong. What is the largest value this gcd can take?