decompwlj 3D

At least one digit contains a loop (version 1)

A001746 on the OEIS · family digit rule

Weight–level plate of At least one digit contains a loop (version 1)
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 viewerA001746 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,998
Level class, k > L9,873 · 9.87 %
Weight class, k ≤ L90,125 · 90.13 %
Ties, k = L48
On the level line L = 19,238
Forced level, l ≤ d²4
Range of a(n)0 … 109,329
Range of the jump d1 … 6
Largest weight k, level L109,321, 54,664

The gaps are 1, 2 and 6; the level share is 9.87 %; L = 1 holds 94 % 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.