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

Open in the 3-D viewerA005349 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 20,334 · 20.33 % |
| Weight class, k ≤ L | 79,663 · 79.67 % |
| Ties, k = L | 4 |
| On the level line L = 1 | 2,956 |
| Forced level, l ≤ d² | 3 |
| Range of a(n) | 1 … 1,033,781 |
| Range of the jump d | 1 … 88 |
| Largest weight k, level L | 1,033,661, 516,683 |
n divisible by its digit sum. Density by digit sum is 9:3:1 according to gcd(s,9), but that structure does not reach the plane: the weight fence is flat and the level share varies only between 11 and 24 %.
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.