Primes having only {0, 1, 9} as digits

Open in the 3-D viewerA199329 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,976 |
| Level class, k > L | 33,143 · 33.15 % |
| Weight class, k ≤ L | 66,833 · 66.85 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 5,874 |
| Forced level, l ≤ d² | 1,821 |
| Range of a(n) | 11 … 10,001,900,090,101 |
| Range of the jump d | 2 … 7,000,000,001,018 |
| Largest weight k, level L | 10,001,199,904,979, 3,333,730,303,969 |
1,723 different gaps occur, from 2 to 7,000,000,001,018; the level share is 33.15 %; 1.8 % of terms are forced level (l <= d^2); there are no ties; 24 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.