Beatty sequence for 1/(3 - e): a(n) = floor(n/(3-e))

Open in the 3-D viewerA098005 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,999 |
| Level class, k > L | 17,544 · 17.54 % |
| Weight class, k ≤ L | 82,455 · 82.46 % |
| Ties, k = L | 34 |
| On the level line L = 1 | 8,557 |
| Forced level, l ≤ d² | 3 |
| Range of a(n) | 3 … 354,964 |
| Range of the jump d | 3 … 4 |
| Largest weight k, level L | 354,953, 88,735 |
The gaps are 3 and 4; the level share is 17.54 %; L = 1 holds 49 % 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.