Primes congruent to {0, 2, 4, 6, 8, 10} modulo 11

Open in the 3-D viewerA137977 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 28,474 · 28.47 % |
| Weight class, k ≤ L | 71,524 · 71.53 % |
| Ties, k = L | 15 |
| On the level line L = 1 | 7,817 |
| Forced level, l ≤ d² | 24 |
| Range of a(n) | 2 … 2,750,123 |
| Range of the jump d | 2 … 264 |
| Largest weight k, level L | 2,749,919, 916,569 |
88 different gaps occur, from 2 to 264; the level share is 28.47 %.
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.