10 for N=1 to 3000
20 if N=fnSod(2^N) then print N,2^N
1010 local S$,Tot,I
1030 for I=1 to len(S$)
Why no more?
There doesn't seem to be a specific reason ruling out further cases. The number of digits in the power should vary linearly with the power and should be about n multiplied by the common log of 2. The "typical" s.o.d. should also then be proportional to n. And the maximum possible sod would be 9*n*log(2), and as small as needed.
Perhaps it's just the great range and standard deviation in the sod that make it more and more unlikely to be a "hit" as the powers get larger.
Posted by Charlie
on 2016-05-27 15:12:52