Primes written in base 4

Open in the 3-D viewerA004678 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,980 |
| Level class, k > L | 27,261 · 27.27 % |
| Weight class, k ≤ L | 72,719 · 72.73 % |
| Ties, k = L | 1 |
| On the level line L = 1 | 4,847 |
| Forced level, l ≤ d² | 1,323 |
| Range of a(n) | 2 … 10,331,103,331 |
| Range of the jump d | 1 … 6,666,666,682 |
| Largest weight k, level L | 10,331,101,069, 3,443,677,773 |
470 different gaps occur, from 1 to 6,666,666,682; the level share is 27.27 %; 1.3 % of terms are forced level (l <= d^2); 20 terms do not decompose.
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.