Primes congruent to 35 mod 64
Open in the 3-D viewerA142940 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 47,979 · 47.98 % |
| Weight class, k ≤ L | 52,019 · 52.02 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 6,104 |
| Forced level, l ≤ d² | 801 |
| Range of a(n) | 163 … 53,530,019 |
| Range of the jump d | 64 … 4,800 |
| Largest weight k, level L | 53,528,099, 822,819 |
67 different gaps occur, from 64 to 4,800; the level share is 47.98 %; there are no ties.
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.