decompwlj 3D

Numbers k such that the sum of distinct primes dividing k is divisible by the largest prime dividing k

A071139 on the OEIS · family multiplicative

Weight–level plate of Numbers k such that the sum of distinct primes dividing k is divisible by the largest prime dividing k
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 viewerA071139 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,999
Level class, k > L23,051 · 23.05 %
Weight class, k ≤ L76,948 · 76.95 %
Ties, k = L13
On the level line L = 17,747
Forced level, l ≤ d²2
Range of a(n)2 … 1,265,993
Range of the jump d1 … 114
Largest weight k, level L1,265,981, 630,564

83 different gaps occur, from 1 to 114; the level share is 23.05 %; L = 1 holds 34 % 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.