Beatty sequence for e^Pi

Open in the 3-D viewerA038152 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 30,705 · 30.71 % |
| Weight class, k ≤ L | 69,293 · 69.29 % |
| Ties, k = L | 13 |
| On the level line L = 1 | 7,347 |
| Forced level, l ≤ d² | 21 |
| Range of a(n) | 23 … 2,314,069 |
| Range of the jump d | 23 … 24 |
| Largest weight k, level L | 2,313,907, 96,407 |
The gaps are 23 and 24; the level share is 30.71 %.
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.