Primes congruent to 5 (mod 12). Also primes p such that x^4 = 9 has no solution mod p

Open in the 3-D viewerA040117 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 40,254 · 40.26 % |
| Weight class, k ≤ L | 59,743 · 59.74 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 16,931 |
| Forced level, l ≤ d² | 54 |
| Range of a(n) | 5 … 5,798,489 |
| Range of the jump d | 12 … 576 |
| Largest weight k, level L | 5,798,189, 445,745 |
41 different gaps occur, from 12 to 576; the level share is 40.26 %; L = 1 holds 42 % 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.