decompwlj 3D

Least positive integers not excluded by the rule that if n is present then 2n+1 and 3n+1 are not allowed

A077477 on the OEIS · family self-referential

Weight–level plate of Least positive integers not excluded by the rule that if n is present then 2n+1 and 3n+1 are not allowed
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 viewerA077477 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,998
Level class, k > L14,357 · 14.36 %
Weight class, k ≤ L85,641 · 85.64 %
Ties, k = L79
On the level line L = 16,743
Forced level, l ≤ d²1
Range of a(n)1 … 163,334
Range of the jump d1 … 4
Largest weight k, level L163,321, 81,665

The gaps are 1, 2, 3 and 4; the level share is 14.36 %; L = 2 holds 53 % 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.