Primes having only {3, 4, 6} as digits

Open in the 3-D viewerA199346 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,987 |
| Level class, k > L | 38,173 · 38.18 % |
| Weight class, k ≤ L | 61,814 · 61.82 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 5,815 |
| Forced level, l ≤ d² | 2,539 |
| Range of a(n) | 3 … 36,334,463,444,663 |
| Range of the jump d | 10 … 26,666,666,667,030 |
| Largest weight k, level L | 36,334,444,626,323, 3,303,121,512,393 |
4,148 different gaps occur, from 10 to 26,666,666,667,030; the level share is 38.18 %; 2.5 % of terms are forced level (l <= d^2); there are no ties; 13 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.