Numbers k whose largest divisor <= sqrt(k) equals 7

Open in the 3-D viewerA162527 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 100,000 |
| Level class, k > L | 23,105 · 23.11 % |
| Weight class, k ≤ L | 76,895 · 76.89 % |
| Ties, k = L | 2 |
| On the level line L = 1 | 2 |
| Forced level, l ≤ d² | 90 |
| Range of a(n) | 49 … 9,097,207 |
| Range of the jump d | 7 … 798 |
| Largest weight k, level L | 1,299,061, 606,403 |
54 different gaps occur, from 7 to 798; the level share is 23.11 %; L = 7 holds 32 % 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.