Numbers whose digits are squares

Open in the 3-D viewerA046030 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,983 |
| Level class, k > L | 15,560 · 15.56 % |
| Weight class, k ≤ L | 84,423 · 84.44 % |
| Ties, k = L | 9 |
| On the level line L = 1 | 7,109 |
| Forced level, l ≤ d² | 438 |
| Range of a(n) | 0 … 140,144,199 |
| Range of the jump d | 1 … 40,000,001 |
| Largest weight k, level L | 140,144,189, 70,072,054 |
17 different gaps occur, from 1 to 40,000,001; the level share is 15.56 %; L = 1 holds 46 % of the level class; 17 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.