Numbers k such that k and k+1 are composite and squarefree

Open in the 3-D viewerA121495 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 16,183 · 16.18 % |
| Weight class, k ≤ L | 83,814 · 83.82 % |
| Ties, k = L | 15 |
| On the level line L = 1 | 9,251 |
| Forced level, l ≤ d² | 3 |
| Range of a(n) | 14 … 385,894 |
| Range of the jump d | 1 … 27 |
| Largest weight k, level L | 385,837, 192,944 |
19 different gaps occur, from 1 to 27; the level share is 16.18 %; L = 1 holds 57 % 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.