Primes without {0, 1} as digits

Open in the 3-D viewerA106116 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,992 |
| Level class, k > L | 25,298 · 25.30 % |
| Weight class, k ≤ L | 74,694 · 74.70 % |
| Ties, k = L | 13 |
| On the level line L = 1 | 7,547 |
| Forced level, l ≤ d² | 325 |
| Range of a(n) | 2 … 6,889,273 |
| Range of the jump d | 1 … 1,222,256 |
| Largest weight k, level L | 6,888,671, 2,296,145 |
247 different gaps occur, from 1 to 1,222,256; the level share is 25.30 %; 8 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.