Primes written in base 6

Open in the 3-D viewerA004680 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,991 |
| Level class, k > L | 30,656 · 30.66 % |
| Weight class, k ≤ L | 69,335 · 69.34 % |
| Ties, k = L | 5 |
| On the level line L = 1 | 11,709 |
| Forced level, l ≤ d² | 619 |
| Range of a(n) | 2 … 43,505,101 |
| Range of the jump d | 1 … 4,444,510 |
| Largest weight k, level L | 43,504,151, 6,207,201 |
238 different gaps occur, from 1 to 4,444,510; the level share is 30.66 %; L = 1 holds 38 % of the level class; 9 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.