Utterly odd numbers: numbers whose binary representation ends in an odd number of ones

Open in the 3-D viewerA079523 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,999 |
| Level class, k > L | 20,560 · 20.56 % |
| Weight class, k ≤ L | 79,439 · 79.44 % |
| Ties, k = L | 33 |
| On the level line L = 1 | 17,352 |
| Forced level, l ≤ d² | 4 |
| Range of a(n) | 1 … 299,999 |
| Range of the jump d | 2 … 4 |
| Largest weight k, level L | 299,977, 99,999 |
The gaps are 2 and 4; the level share is 20.56 %; L = 1 holds 84 % 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.