Primes p such that 3*p-4, 3*p-10, and 3*p-14 are all prime

Open in the 3-D viewerA230223 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 65,464 · 65.47 % |
| Weight class, k ≤ L | 34,533 · 34.53 % |
| Ties, k = L | 3 |
| On the level line L = 1 | 8,006 |
| Forced level, l ≤ d² | 9,118 |
| Range of a(n) | 7 … 442,641,539 |
| Range of the jump d | 2 … 65,620 |
| Largest weight k, level L | 442,606,807, 146,966,825 |
9,201 different gaps occur, from 2 to 65,620; the level share is 65.47 %; 9.1 % of terms are forced level (l <= d^2).
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.