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

Open in the 3-D viewerA199342 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,984 |
| Level class, k > L | 36,942 · 36.95 % |
| Weight class, k ≤ L | 63,042 · 63.05 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 5,745 |
| Forced level, l ≤ d² | 2,640 |
| Range of a(n) | 2 … 23,444,322,324,323 |
| Range of the jump d | 1 … 17,777,777,778,920 |
| Largest weight k, level L | 23,444,322,231,623, 2,131,212,940,293 |
1,236 different gaps occur, from 1 to 17,777,777,778,920; the level share is 36.95 %; 2.6 % of terms are forced level (l <= d^2); there are no ties; 16 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.