Lower prime of a difference of 10 between consecutive primes

Open in the 3-D viewerA031928 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 100,000 |
| Level class, k > L | 47,713 · 47.71 % |
| Weight class, k ≤ L | 52,287 · 52.29 % |
| Ties, k = L | 19 |
| On the level line L = 1 | 16,698 |
| Forced level, l ≤ d² | 247 |
| Range of a(n) | 139 … 19,733,449 |
| Range of the jump d | 12 … 2,742 |
| Largest weight k, level L | 19,732,099, 1,495,573 |
269 different gaps occur, from 12 to 2,742; the level share is 47.71 %; L = 1 holds 35 % 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.