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

Open in the 3-D viewerA260128 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,977 |
| Level class, k > L | 32,628 · 32.64 % |
| Weight class, k ≤ L | 67,349 · 67.36 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 5,313 |
| Forced level, l ≤ d² | 2,416 |
| Range of a(n) | 2 … 3,339,929,293,399 |
| Range of the jump d | 1 … 1,222,222,223,030 |
| Largest weight k, level L | 3,339,923,929,327, 667,984,446,645 |
3,475 different gaps occur, from 1 to 1,222,222,223,030; the level share is 32.64 %; 2.4 % of terms are forced level (l <= d^2); there are no ties; 23 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.