a(n) = (n^3 + 24*n^2 + 65*n + 36)/6

Open in the 3-D viewerA087863 on the OEIS
| Terms | 100,000 (n = 0 … 99,999) |
|---|---|
| Decomposable (a > 2d) | 99,996 |
| Level class, k > L | 99,996 · 100.00 % |
| Weight class, k ≤ L | 0 · 0.00 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 12,937 |
| Forced level, l ≤ d² | 99,996 |
| Range of a(n) | 6 … 166,701,666,999,999 |
| Range of the jump d | 15 … 5,000,750,007 |
| Largest weight k, level L | 166,681,664,900,027, 33,151 |
Every gap is different, from 15 to 5,000,750,007; every decomposable term is forced level (l <= d^2).
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.