Primes of the form 210n + 13

Open in the 3-D viewerA140841 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 62,597 · 62.60 % |
| Weight class, k ≤ L | 37,401 · 37.40 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 24,110 |
| Forced level, l ≤ d² | 1,232 |
| Range of a(n) | 13 … 82,270,663 |
| Range of the jump d | 210 … 9,450 |
| Largest weight k, level L | 82,267,723, 387,253 |
37 different gaps occur, from 210 to 9,450; the level share is 62.60 %; 1.2 % of terms are forced level (l <= d^2); L = 1 holds 39 % of the level class; 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.