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

Open in the 3-D viewerA087363 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,987 |
| Level class, k > L | 34,462 · 34.47 % |
| Weight class, k ≤ L | 65,525 · 65.53 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 6,265 |
| Forced level, l ≤ d² | 1,844 |
| Range of a(n) | 3 … 5,575,773,353,533 |
| Range of the jump d | 2 … 2,555,555,557,584 |
| Largest weight k, level L | 5,575,757,576,969, 796,511,110,767 |
1,225 different gaps occur, from 2 to 2,555,555,557,584; the level share is 34.47 %; 1.8 % 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.