Numbers having at least one prime gap in their factorization
Open in the 3-D viewerA073492 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 100,000 |
| Level class, k > L | 10,490 · 10.49 % |
| Weight class, k ≤ L | 89,510 · 89.51 % |
| Ties, k = L | 65 |
| On the level line L = 1 | 9,059 |
| Forced level, l ≤ d² | 3 |
| Range of a(n) | 10 … 111,274 |
| Range of the jump d | 1 … 6 |
| Largest weight k, level L | 111,271, 55,636 |
6 different gaps occur, from 1 to 6; the level share is 10.49 %; L = 1 holds 86 % of the level class.
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.