Numbers congruent to {1, 4} mod 15

Open in the 3-D viewerA146510 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 28,423 · 28.42 % |
| Weight class, k ≤ L | 71,574 · 71.58 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 15,056 |
| Forced level, l ≤ d² | 9 |
| Range of a(n) | 1 … 749,989 |
| Range of the jump d | 3 … 12 |
| Largest weight k, level L | 749,923, 187,492 |
The gaps are 3 and 12; the level share is 28.42 %; L = 1 holds 53 % of the level class; there are no ties.
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.