Primes with minimal digit > 2

Open in the 3-D viewerA106115 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,992 |
| Level class, k > L | 24,971 · 24.97 % |
| Weight class, k ≤ L | 75,021 · 75.03 % |
| Ties, k = L | 12 |
| On the level line L = 1 | 6,956 |
| Forced level, l ≤ d² | 486 |
| Range of a(n) | 3 … 37,649,947 |
| Range of the jump d | 2 … 23,333,374 |
| Largest weight k, level L | 37,647,781, 12,549,655 |
302 different gaps occur, from 2 to 23,333,374; the level share is 24.97 %; 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.