Primes p such that p+3 is a semiprime

Open in the 3-D viewerA092109 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 40,924 · 40.93 % |
| Weight class, k ≤ L | 59,073 · 59.07 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 7,810 |
| Forced level, l ≤ d² | 167 |
| Range of a(n) | 3 … 17,571,959 |
| Range of the jump d | 4 … 2,328 |
| Largest weight k, level L | 17,569,703, 3,505,179 |
340 different gaps occur, from 4 to 2,328; the level share is 40.93 %; 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.