Primes p such that x^4 = 2 has a solution mod p

Open in the 3-D viewerA040098 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,996 |
| Level class, k > L | 30,546 · 30.55 % |
| Weight class, k ≤ L | 69,450 · 69.45 % |
| Ties, k = L | 4 |
| On the level line L = 1 | 7,380 |
| Forced level, l ≤ d² | 32 |
| Range of a(n) | 2 … 3,751,567 |
| Range of the jump d | 2 … 366 |
| Largest weight k, level L | 3,751,141, 1,250,055 |
110 different gaps occur, from 2 to 366; the level share is 30.55 %.
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.