a(n) = n-th prime + n-th nonprime

Open in the 3-D viewerA022797 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 26,115 · 26.12 % |
| Weight class, k ≤ L | 73,883 · 73.88 % |
| Ties, k = L | 20 |
| On the level line L = 1 | 8,944 |
| Forced level, l ≤ d² | 6 |
| Range of a(n) | 3 … 1,410,195 |
| Range of the jump d | 3 … 115 |
| Largest weight k, level L | 1,409,531, 352,475 |
94 different gaps occur, from 3 to 115; the level share is 26.12 %; L = 1 holds 34 % 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.