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

Open in the 3-D viewerA004920 on the OEIS
| Terms | 100,000 (n = 0 … 99,999) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 25,807 · 25.81 % |
| Weight class, k ≤ L | 74,190 · 74.19 % |
| Ties, k = L | 13 |
| On the level line L = 1 | 7,773 |
| Forced level, l ≤ d² | 9 |
| Range of a(n) | 0 … 1,109,005 |
| Range of the jump d | 11 … 12 |
| Largest weight k, level L | 1,108,817, 92,407 |
The gaps are 11 and 12; the level share is 25.81 %; L = 1 holds 30 % 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.