If n appears so do 2n, 3n+2, 6n+3

Open in the 3-D viewerA005658 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 13,514 · 13.51 % |
| Weight class, k ≤ L | 86,483 · 86.49 % |
| Ties, k = L | 74 |
| On the level line L = 1 | 6,438 |
| Forced level, l ≤ d² | 3 |
| Range of a(n) | 1 … 269,085 |
| Range of the jump d | 1 … 88 |
| Largest weight k, level L | 269,069, 134,542 |
50 different gaps occur, from 1 to 88; the level share is 13.51 %; L = 1 holds 48 % 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.