Odd primes for which 2 is not a primitive root

Open in the 3-D viewerA216838 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 26,769 · 26.77 % |
| Weight class, k ≤ L | 73,229 · 73.23 % |
| Ties, k = L | 9 |
| On the level line L = 1 | 7,788 |
| Forced level, l ≤ d² | 15 |
| Range of a(n) | 7 … 2,157,769 |
| Range of the jump d | 2 … 240 |
| Largest weight k, level L | 2,157,709, 719,255 |
90 different gaps occur, from 2 to 240; the level share is 26.77 %.
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.