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

Open in the 3-D viewerA036953 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,975 |
| Level class, k > L | 36,492 · 36.50 % |
| Weight class, k ≤ L | 63,483 · 63.50 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 5,796 |
| Forced level, l ≤ d² | 2,320 |
| Range of a(n) | 2 … 20,122,122,022,001 |
| Range of the jump d | 9 … 7,777,777,778,990 |
| Largest weight k, level L | 20,122,120,209,311, 1,829,282,727,291 |
1,280 different gaps occur, from 9 to 7,777,777,778,990; the level share is 36.50 %; 2.3 % of terms are forced level (l <= d^2); there are no ties; 25 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.