a(n) = 3600*n^2 - 1601*n + 178

Open in the 3-D viewerA157853 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| 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 | 6,403 |
| Forced level, l ≤ d² | 99,996 |
| Range of a(n) | 2,177 … 35,999,839,900,178 |
| Range of the jump d | 9,199 … 720,001,999 |
| Largest weight k, level L | 35,999,119,898,179, 49,943 |
Every gap is different, from 9,199 to 720,001,999; 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.