a(n) = floor(n*phi^6), phi = golden ratio, A001622

Open in the 3-D viewerA004921 on the OEIS
| Terms | 100,000 (n = 0 … 99,999) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 29,170 · 29.17 % |
| Weight class, k ≤ L | 70,827 · 70.83 % |
| Ties, k = L | 19 |
| On the level line L = 1 | 7,564 |
| Forced level, l ≤ d² | 17 |
| Range of a(n) | 0 … 1,794,409 |
| Range of the jump d | 17 … 18 |
| Largest weight k, level L | 1,794,301, 99,513 |
The gaps are 17 and 18; the level share is 29.17 %.
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.