Numbers with 16 divisors

Open in the 3-D viewerA030634 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 100,000 |
| Level class, k > L | 19,887 · 19.89 % |
| Weight class, k ≤ L | 80,113 · 80.11 % |
| Ties, k = L | 13 |
| On the level line L = 1 | 4,755 |
| Forced level, l ≤ d² | 17 |
| Range of a(n) | 120 … 796,618 |
| Range of the jump d | 1 … 97 |
| Largest weight k, level L | 796,447, 398,275 |
68 different gaps occur, from 1 to 97; the level share is 19.89 %; L = 2 holds 36 % 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.