Numbers k such that 2k-3 is prime

Open in the 3-D viewerA098090 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 100,000 |
| Level class, k > L | 15,125 · 15.12 % |
| Weight class, k ≤ L | 84,875 · 84.88 % |
| Ties, k = L | 14 |
| On the level line L = 1 | 4,626 |
| Forced level, l ≤ d² | 1 |
| Range of a(n) | 3 … 649,862 |
| Range of the jump d | 1 … 57 |
| Largest weight k, level L | 649,787, 324,765 |
53 different gaps occur, from 1 to 57; the level share is 15.12 %; L = 1 holds 31 % 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.