a(n) = floor(n*phi) + 1, where phi = (1+sqrt(5))/2

Open in the 3-D viewerA026351 on the OEIS
| Terms | 100,000 (n = 0 … 99,999) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 12,099 · 12.10 % |
| Weight class, k ≤ L | 87,899 · 87.90 % |
| Ties, k = L | 47 |
| On the level line L = 1 | 9,071 |
| Forced level, l ≤ d² | 1 |
| Range of a(n) | 1 … 161,802 |
| Range of the jump d | 1 … 2 |
| Largest weight k, level L | 161,779, 80,900 |
The gaps are 1 and 2; the level share is 12.10 %; L = 1 holds 75 % 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.