Primes containing only digits from the set (0,1,2,3,4,5)

Open in the 3-D viewerA036958 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,989 |
| Level class, k > L | 28,597 · 28.60 % |
| Weight class, k ≤ L | 71,392 · 71.40 % |
| Ties, k = L | 4 |
| On the level line L = 1 | 6,110 |
| Forced level, l ≤ d² | 741 |
| Range of a(n) | 2 … 111,415,313 |
| Range of the jump d | 1 … 44,444,570 |
| Largest weight k, level L | 111,413,209, 37,137,473 |
390 different gaps occur, from 1 to 44,444,570; the level share is 28.60 %; 11 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.