Primes having only {0, 1, 8} as digits
Open in the 3-D viewerA061247 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,975 |
| Level class, k > L | 40,158 · 40.17 % |
| Weight class, k ≤ L | 59,817 · 59.83 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 5,713 |
| Forced level, l ≤ d² | 3,410 |
| Range of a(n) | 11 … 80,180,108,881,811 |
| Range of the jump d | 10 … 61,111,111,112,190 |
| Largest weight k, level L | 80,180,108,875,541, 7,282,828,289,181 |
4,187 different gaps occur, from 10 to 61,111,111,112,190; the level share is 40.17 %; 3.4 % 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.