Numbers with a unique partition as the sum of 2 squares x^2 + y^2

Open in the 3-D viewerA125022 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,996 |
| Level class, k > L | 18,141 · 18.14 % |
| Weight class, k ≤ L | 81,855 · 81.86 % |
| Ties, k = L | 14 |
| On the level line L = 1 | 5,149 |
| Forced level, l ≤ d² | 2 |
| Range of a(n) | 0 … 961,273 |
| Range of the jump d | 1 … 91 |
| Largest weight k, level L | 961,063, 480,516 |
80 different gaps occur, from 1 to 91; the level share is 18.14 %.
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.