Primes == 3 (mod 8)

Open in the 3-D viewerA007520 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 33,292 · 33.29 % |
| Weight class, k ≤ L | 66,705 · 66.71 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 6,815 |
| Forced level, l ≤ d² | 67 |
| Range of a(n) | 3 … 5,795,291 |
| Range of the jump d | 8 … 600 |
| Largest weight k, level L | 5,793,979, 643,715 |
Primes 3 mod 8. Every gap is 0 mod 8, so l = 3 (mod 8); no square is 3 mod 4, so there are no ties, by proof. The level share is 33.29 %.
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.