a(n) = n*(n+1)*(7*n-6)/2

Open in the 3-D viewerA256718 on the OEIS
| Terms | 100,000 (n = 0 … 99,999) |
|---|---|
| Decomposable (a > 2d) | 99,993 |
| Level class, k > L | 99,993 · 100.00 % |
| Weight class, k ≤ L | 0 · 0.00 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 775 |
| Forced level, l ≤ d² | 99,993 |
| Range of a(n) | 0 … 3,499,900,000,650,000 |
| Range of the jump d | 1 … 104,999,050,000 |
| Largest weight k, level L | 3,480,615,893,210,843, 33,209 |
Every gap is different, from 1 to 104,999,050,000; every decomposable term is forced level (l <= d^2); 7 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.