Even numbers n>=6 for which lpf(n-1) > lpf(n-3), where lpf = least prime factor

Open in the 3-D viewerA243937 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,999 |
| Level class, k > L | 15,143 · 15.14 % |
| Weight class, k ≤ L | 84,856 · 84.86 % |
| Ties, k = L | 2 |
| On the level line L = 1 | 1 |
| Forced level, l ≤ d² | 4 |
| Range of a(n) | 6 … 392,592 |
| Range of the jump d | 2 … 6 |
| Largest weight k, level L | 196,277, 98,146 |
The gaps are 2, 4 and 6; the level share is 15.14 %; L = 2 holds 61 % 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.