Prime having only {0, 1, 4, 9} as digits

Open in the 3-D viewerA061246 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,981 |
| Level class, k > L | 35,455 · 35.46 % |
| Weight class, k ≤ L | 64,526 · 64.54 % |
| Ties, k = L | 1 |
| On the level line L = 1 | 7,676 |
| Forced level, l ≤ d² | 1,937 |
| Range of a(n) | 11 … 14,494,144,009 |
| Range of the jump d | 2 … 4,000,000,910 |
| Largest weight k, level L | 14,494,109,353, 4,831,369,669 |
2,392 different gaps occur, from 2 to 4,000,000,910; the level share is 35.46 %; 1.9 % of terms are forced level (l <= d^2); 19 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.