Numbers n such that n^2 - 1 is expressible as the sum of two nonzero squares in at least one way

Open in the 3-D viewerA050795 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 36,360 · 36.36 % |
| Weight class, k ≤ L | 63,637 · 63.64 % |
| Ties, k = L | 8 |
| On the level line L = 1 | 11,438 |
| Forced level, l ≤ d² | 57 |
| Range of a(n) | 3 … 5,305,033 |
| Range of the jump d | 2 … 490 |
| Largest weight k, level L | 5,304,989, 1,766,021 |
148 different gaps occur, from 2 to 490; the level share is 36.36 %; L = 1 holds 31 % of the level class.
The decomposition
Every term of a strictly increasing sequence is written a(n) = k(n)·L(n) + d(n): the jump d = a(n+1) − a(n), the weight k the least divisor of a − d greater than d, the level L = (a − d)/k. A term decomposes when a > 2d; it is in the level class when k > L and in the weight class when k ≤ L. See decompwlj.com and arXiv:0711.0865, or how it works, with worked examples and a live one.