Numbers that are the sum of 2 squares

Open in the 3-D viewerA001481 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,996 |
| Level class, k > L | 15,945 · 15.95 % |
| Weight class, k ≤ L | 84,051 · 84.05 % |
| Ties, k = L | 17 |
| On the level line L = 1 | 6,154 |
| Forced level, l ≤ d² | 2 |
| Range of a(n) | 0 … 446,665 |
| Range of the jump d | 1 … 34 |
| Largest weight k, level L | 446,647, 223,312 |
n = x^2 + y^2: every prime 3 mod 4 divides n to an even power. Starts at a(1) = 0. Density ~ 0.764 x / sqrt(log x) (Landau-Ramanujan). The gaps stay below 35 here and the level share is 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.