decompwlj 3D

Ludic numbers: apply the same sieve as Eratosthenes, but cross off every k-th remaining number

A003309 on the OEIS · family sieve

Weight–level plate of Ludic numbers: apply the same sieve as Eratosthenes, but cross off every k-th remaining number
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 viewerA003309 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,996
Level class, k > L27,211 · 27.21 %
Weight class, k ≤ L72,785 · 72.79 %
Ties, k = L26
On the level line L = 19,022
Forced level, l ≤ d²8
Range of a(n)1 … 1,561,333
Range of the jump d1 … 120
Largest weight k, level L1,561,151, 520,359

59 different gaps occur, from 1 to 120; the level share is 27.21 %; L = 1 holds 33 % 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.