Numbers k such that the maximum exponent in its prime factorization is not less than the number of positive exponents (A051903(k) >= A001221(k))

A212165 on the OEIS · family multiplicative

Weight–level plate of Numbers k such that the maximum exponent in its prime factorization is not less than the number of positive exponents (A051903(k) >= A001221(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 viewer A212165 on the OEIS

Terms	100,000 (n = 1 … 100,000)
Decomposable (a > 2d)	99,998
Level class, k > L	14,771 · 14.77 %
Weight class, k ≤ L	85,227 · 85.23 %
Ties, k = L	20
On the level line L = 1	7,370
Forced level, l ≤ d²	1
Range of a(n)	1 … 367,544
Range of the jump d	1 … 19
Largest weight k, level L	367,541, 183,759

18 different gaps occur, from 1 to 19; the level share is 14.77 %; L = 1 holds 50 % 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.