Problem Archive

Consider numbers $t(n)$ of the form $t(n) = 2n^2 - 1$ with $n \gt 1$.
The first such numbers are $7, 17, 31, 49, 71, 97, 127$ and $161$.
It turns out that only $49 = 7 \cdot 7$ and $161 = 7 \cdot 23$ are not prime.
For $n \le 10000$ there are $2202$ numbers $t(n)$ that are prime.

How many numbers $t(n)$ are prime for $n \le 50\,000\,000$?

Solution
No solution yet. Write yours at solutions/s216.md.
Problems sourced from Project Euler · Non-commercial & educational use only · CC BY-NC-SA 4.0