Primes not congruent to +- 1, 3, or 4 (mod 13)

Open in the 3-D viewerA120330 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 30,788 · 30.79 % |
| Weight class, k ≤ L | 69,209 · 69.21 % |
| Ties, k = L | 19 |
| On the level line L = 1 | 8,682 |
| Forced level, l ≤ d² | 23 |
| Range of a(n) | 2 … 2,745,767 |
| Range of the jump d | 2 … 312 |
| Largest weight k, level L | 2,745,737, 915,123 |
107 different gaps occur, from 2 to 312; the level share is 30.79 %.
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.