decompwlj 3D

a(n+1) = a(n) + (number of distinct prime factors of a(n)) for n>1; a(1)=1, a(2)=2

A094222 on the OEIS · family self-referential

Weight–level plate of a(n+1) = a(n) + (number of distinct prime factors of a(n)) for n>1; a(1)=1, a(2)=2
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 viewerA094222 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,998
Level class, k > L12,298 · 12.30 %
Weight class, k ≤ L87,700 · 87.70 %
Ties, k = L25
On the level line L = 16,581
Forced level, l ≤ d²1
Range of a(n)1 … 279,353
Range of the jump d1 … 6
Largest weight k, level L279,121, 139,676

6 different gaps occur, from 1 to 6; the level share is 12.30 %; L = 1 holds 54 % 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.