Primes whose digits are all odd

Open in the 3-D viewerA030096 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,990 |
| Level class, k > L | 28,273 · 28.28 % |
| Weight class, k ≤ L | 71,717 · 71.72 % |
| Ties, k = L | 7 |
| On the level line L = 1 | 6,146 |
| Forced level, l ≤ d² | 1,204 |
| Range of a(n) | 3 … 311,719,139 |
| Range of the jump d | 2 … 111,111,140 |
| Largest weight k, level L | 311,713,379, 103,905,843 |
561 different gaps occur, from 2 to 111,111,140; the level share is 28.28 %; 1.2 % of terms are forced level (l <= d^2); 10 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.