decompwlj 3D

Odd Niven (or Harshad) numbers: odd numbers that are divisible by the sum of their digits

A101813 on the OEIS · family digit rule

Weight–level plate of Odd Niven (or Harshad) numbers: odd numbers that are divisible by the sum of their digits
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 viewerA101813 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,996
Level class, k > L33,932 · 33.93 %
Weight class, k ≤ L66,064 · 66.07 %
Ties, k = L13
On the level line L = 110,755
Forced level, l ≤ d²57
Range of a(n)1 … 4,725,665
Range of the jump d2 … 480
Largest weight k, level L4,724,051, 1,575,057

185 different gaps occur, from 2 to 480; the level share is 33.93 %; L = 1 holds 32 % 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.