decompwlj 3D

Binary sieve: delete every 2nd number, then every 4th, 8th, etc

A007950 on the OEIS · family sieve

Weight–level plate of Binary sieve: delete every 2nd number, then every 4th, 8th, etc
Click the plate to explore it in 3-D. Weight k across, level L up, both on log scales: blue in the weight class (k ≤ L), orange in the level class (k > L). The dashed diagonal is k = L.
Open in the 3-D viewerA007950 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,997
Level class, k > L21,191 · 21.19 %
Weight class, k ≤ L78,806 · 78.81 %
Ties, k = L130
On the level line L = 117,178
Forced level, l ≤ d²3
Range of a(n)1 … 346,245
Range of the jump d2 … 16
Largest weight k, level L346,223, 115,413

8 different gaps occur, from 2 to 16; the level share is 21.19 %; L = 1 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.