Numbers k such that there is no prime between 10*k and 10*k+9

Open in the 3-D viewerA032352 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 14,401 · 14.40 % |
| Weight class, k ≤ L | 85,597 · 85.60 % |
| Ties, k = L | 30 |
| On the level line L = 1 | 9,397 |
| Forced level, l ≤ d² | 6 |
| Range of a(n) | 20 … 230,687 |
| Range of the jump d | 1 … 28 |
| Largest weight k, level L | 230,653, 115,341 |
23 different gaps occur, from 1 to 28; the level share is 14.40 %; L = 1 holds 65 % 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.