Numbers whose base-4 representation has the same number of 1's and 2's

Open in the 3-D viewerA039004 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 10,786 · 10.79 % |
| Weight class, k ≤ L | 89,211 · 89.21 % |
| Ties, k = L | 1 |
| On the level line L = 1 | 3 |
| Forced level, l ≤ d² | 11 |
| Range of a(n) | 0 … 564,681 |
| Range of the jump d | 3 … 768 |
| Largest weight k, level L | 188,179, 141,168 |
9 different gaps occur, from 3 to 768; the level share is 10.79 %; L = 3 holds 81 % 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.