Numbers that are congruent to {0, 1, 2, 3, 4} mod 7

Open in the 3-D viewerA047337 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,996 |
| Level class, k > L | 10,607 · 10.61 % |
| Weight class, k ≤ L | 89,389 · 89.39 % |
| Ties, k = L | 71 |
| On the level line L = 1 | 8,660 |
| Forced level, l ≤ d² | 1 |
| Range of a(n) | 0 … 139,997 |
| Range of the jump d | 1 … 3 |
| Largest weight k, level L | 139,987, 69,997 |
The gaps are 1 and 3; the level share is 10.61 %; L = 1 holds 82 % 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.