Numbers using only digits 1 and 5

Open in the 3-D viewerA276037 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,969 |
| Level class, k > L | 18,432 · 18.44 % |
| Weight class, k ≤ L | 81,537 · 81.56 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 7,773 |
| Forced level, l ≤ d² | 995 |
| Range of a(n) | 1 … 5,111,155,151,511,115 |
| Range of the jump d | 4 … 3,555,555,555,555,556 |
| Largest weight k, level L | 5,111,155,151,155,147, 730,165,021,593,021 |
31 different gaps occur, from 4 to 3,555,555,555,555,556; the level share is 18.44 %; L = 1 holds 42 % of the level class; there are no ties; 31 terms do not decompose.
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.