Primes having only {4, 6, 9} as digits

Open in the 3-D viewerA107666 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,989 |
| Level class, k > L | 40,428 · 40.43 % |
| Weight class, k ≤ L | 59,561 · 59.57 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 6,246 |
| Forced level, l ≤ d² | 3,068 |
| Range of a(n) | 449 … 49,464,466,944,449 |
| Range of the jump d | 20 … 34,444,444,448,220 |
| Largest weight k, level L | 49,464,466,669,339, 2,354,595,235,449 |
3,935 different gaps occur, from 20 to 34,444,444,448,220; the level share is 40.43 %; 3.1 % of terms are forced level (l <= d^2); there are no ties; 11 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.