Primes of the form 256*k + 1

Open in the 3-D viewerA208178 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 58,148 · 58.15 % |
| Weight class, k ≤ L | 41,849 · 41.85 % |
| Ties, k = L | 9 |
| On the level line L = 1 | 5,719 |
| Forced level, l ≤ d² | 3,954 |
| Range of a(n) | 257 … 232,530,433 |
| Range of the jump d | 256 … 26,112 |
| Largest weight k, level L | 232,482,049, 895,233 |
80 different gaps occur, from 256 to 26,112; the level share is 58.15 %; 4.0 % of terms are forced level (l <= d^2).
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.