Sums of two nonnegative cubes

Open in the 3-D viewerA004999 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,994 |
| Level class, k > L | 49,923 · 49.93 % |
| Weight class, k ≤ L | 50,071 · 50.07 % |
| Ties, k = L | 3 |
| On the level line L = 1 | 5,484 |
| Forced level, l ≤ d² | 1,266 |
| Range of a(n) | 0 … 107,865,801 |
| Range of the jump d | 1 … 16,955 |
| Largest weight k, level L | 107,842,789, 53,585,937 |
5,360 different gaps occur, from 1 to 16,955; the level share is 49.93 %; 1.3 % of terms are forced level (l <= d^2); 6 terms do not decompose.
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.