Numbers that are congruent to {0, 3, 7} mod 12

Open in the 3-D viewerA083031 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 23,724 · 23.72 % |
| Weight class, k ≤ L | 76,273 · 76.28 % |
| Ties, k = L | 1 |
| On the level line L = 1 | 8,486 |
| Forced level, l ≤ d² | 3 |
| Range of a(n) | 0 … 399,996 |
| Range of the jump d | 3 … 5 |
| Largest weight k, level L | 399,983, 79,989 |
The gaps are 3, 4 and 5; the level share is 23.72 %; L = 2 holds 38 % 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.