Geometric Connell sequence: 1 odd, 2 even, 4 odd, 8 even, ..

Open in the 3-D viewerA049039 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 14,259 · 14.26 % |
| Weight class, k ≤ L | 85,739 · 85.74 % |
| Ties, k = L | 47 |
| On the level line L = 1 | 9,997 |
| Forced level, l ≤ d² | 1 |
| Range of a(n) | 1 … 199,983 |
| Range of the jump d | 1 … 2 |
| Largest weight k, level L | 199,967, 66,659 |
The gaps are 1 and 2; the level share is 14.26 %; L = 1 holds 70 % 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.