Numbers k such that 2*k + 3 is composite

Open in the 3-D viewerA153238 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 11,478 · 11.48 % |
| Weight class, k ≤ L | 88,520 · 88.52 % |
| Ties, k = L | 69 |
| On the level line L = 1 | 10,091 |
| Forced level, l ≤ d² | 1 |
| Range of a(n) | 3 … 121,463 |
| Range of the jump d | 1 … 3 |
| Largest weight k, level L | 121,447, 60,731 |
The gaps are 1, 2 and 3; the level share is 11.48 %; L = 1 holds 88 % 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.