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

Open in the 3-D viewerA199345 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,985 |
| Level class, k > L | 36,722 · 36.73 % |
| Weight class, k ≤ L | 63,263 · 63.27 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 5,721 |
| Forced level, l ≤ d² | 2,671 |
| Range of a(n) | 3 … 35,335,443,435,443 |
| Range of the jump d | 2 … 27,777,777,780,890 |
| Largest weight k, level L | 35,335,434,541,573, 3,212,304,949,503 |
1,276 different gaps occur, from 2 to 27,777,777,780,890; the level share is 36.73 %; 2.7 % of terms are forced level (l <= d^2); there are no ties; 15 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.