Squares of form 2 n^2 - 1
Jump to navigation
Jump to search
This theorem requires a proof.
Follows somehow from the fact that these numbers are the hypotenuses of Definition:Almost Isosceles Pythagorean Triangles.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
Theorem
The sequence of integers $\left\langle{n}\right\rangle$ such that $2 n^2 - 1$ is square begins:
- $1, 5, 29, 169, 985, 5741, 33461, 195025, 1136689, 6625109, \ldots$
This sequence is A001653 in the On-Line Encyclopedia of Integer Sequences (N. J. A. Sloane (Ed.), 2008).
Proof
Follows somehow from the fact that these numbers are the hypotenuses of Definition:Almost Isosceles Pythagorean Triangles.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
When this page/section has been completed, {{ProofWanted}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Sources
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $29$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $29$