Numbers whose digits contain no loops (version 2)

Open in the 3-D viewerA001742 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,996 |
| Level class, k > L | 17,139 · 17.14 % |
| Weight class, k ≤ L | 82,857 · 82.86 % |
| Ties, k = L | 14 |
| On the level line L = 1 | 14,001 |
| Forced level, l ≤ d² | 316 |
| Range of a(n) | 1 … 11,155,557 |
| Range of the jump d | 1 … 3,333,334 |
| Largest weight k, level L | 11,155,513, 5,577,775 |
15 different gaps occur, from 1 to 3,333,334; the level share is 17.14 %; L = 1 holds 82 % 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.