Semiprimes sandwiched between semiprimes

Open in the 3-D viewerA086005 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,999 |
| Level class, k > L | 50,000 · 50.00 % |
| Weight class, k ≤ L | 49,999 · 50.00 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 3 |
| Forced level, l ≤ d² | 1,537 |
| Range of a(n) | 34 … 96,015,922 |
| Range of the jump d | 4 … 13,404 |
| Largest weight k, level L | 48,003,013, 17,573,010 |
1,510 different gaps occur, from 4 to 13,404; the level share is 50.00 %; 1.5 % of terms are forced level (l <= d^2); there are no ties.
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.