a(n) = floor(n*phi^4), where phi is the golden ratio, A001622

Open in the 3-D viewerA004919 on the OEIS
| Terms | 100,000 (n = 0 … 99,999) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 22,263 · 22.26 % |
| Weight class, k ≤ L | 77,734 · 77.74 % |
| Ties, k = L | 18 |
| On the level line L = 1 | 8,083 |
| Forced level, l ≤ d² | 6 |
| Range of a(n) | 0 … 685,403 |
| Range of the jump d | 6 … 7 |
| Largest weight k, level L | 685,231, 97,909 |
The gaps are 6 and 7; the level share is 22.26 %; L = 1 holds 36 % of the level class.
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.