Cuban primes: primes which are the difference of two consecutive cubes

Open in the 3-D viewerA002407 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,994 |
| Level class, k > L | 99,994 · 100.00 % |
| Weight class, k ≤ L | 0 · 0.00 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 16,107 |
| Forced level, l ≤ d² | 99,994 |
| Range of a(n) | 7 … 1,792,617,147,127 |
| Range of the jump d | 12 … 365,910,360 |
| Largest weight k, level L | 1,792,598,594,923, 373,417 |
98,612 different gaps occur, from 12 to 365,910,360; every decomposable term is 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.