Find all integers n such that S(n) = S(2n) = ... = S(n*n), where S is the sum of the base10 digits.
(In reply to
computer explorationno proof by Charlie)
Well, that suffered from lack of precision.
With DEFDBL AZ, we see that 9999 as well as 99999 and 999999 and 9999999 also work.
I'm assuming it works for all 10^k1.

Posted by Charlie
on 20121122 12:14:06 