Prime numbers using only the curved digits 0, 3, 6, 8 and 9
Open in the 3-D viewerA079652 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,985 |
| Level class, k > L | 32,607 · 32.61 % |
| Weight class, k ≤ L | 67,378 · 67.39 % |
| Ties, k = L | 1 |
| On the level line L = 1 | 8,583 |
| Forced level, l ≤ d² | 1,252 |
| Range of a(n) | 3 … 998,003,009 |
| Range of the jump d | 4 … 200,000,190 |
| Largest weight k, level L | 998,000,503, 199,393,677 |
1,392 different gaps occur, from 4 to 200,000,190; the level share is 32.61 %; 1.3 % of terms are forced level (l <= d^2); 15 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.