Numbers that are the sum of 2 nonzero squares

Open in the 3-D viewerA000404 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 15,969 · 15.97 % |
| Weight class, k ≤ L | 84,029 · 84.03 % |
| Ties, k = L | 17 |
| On the level line L = 1 | 6,157 |
| Forced level, l ≤ d² | 3 |
| Range of a(n) | 2 … 448,082 |
| Range of the jump d | 1 … 34 |
| Largest weight k, level L | 448,027, 224,000 |
x^2 + y^2 with x, y >= 1. The plane is almost exactly that of all sums of two squares (15.97 % level against 15.95 %).
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.