Numbers k such that all digits have same parity

Open in the 3-D viewerA059708 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 15,491 · 15.49 % |
| Weight class, k ≤ L | 84,506 · 84.51 % |
| Ties, k = L | 19 |
| On the level line L = 1 | 7,846 |
| Forced level, l ≤ d² | 434 |
| Range of a(n) | 0 … 5,177,779 |
| Range of the jump d | 1 … 222,223 |
| Largest weight k, level L | 5,177,771, 1,999,999 |
13 different gaps occur, from 1 to 222,223; the level share is 15.49 %; L = 1 holds 51 % 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.