22 Nov
2013
22 Nov
'13
3:12 p.m.
Though, there may not be a straightforward asymptotic expression, since the counts have been made for number 1 to B^k for some k, where B is the number base. Like Benford's law, the fraction probably wobbles back and forth, and it's not clear to me if applying e.g. Cesaro summation or the like would cause it to settle down. --Dan On 2013-11-22, at 1:29 PM, Neil Sloane wrote:
In view of the contradictory arguments we've seen, would someone PLEASE add the definitive answer to A060792 ? "The following heuristic argument shows that there are almost certainly onlyfinitely/infinitely many terms in this sequence ..." Thanks! Neil