I encountered an intriguing problem and I think I have a solution, but I want to run it by some of the smarter people around here:
Find the smallest integer $n, n>1$ such that $C(n)=n, C(n)$ is the total number of 1s that appear as you count from 1. For example, $C(9) = 1$, counting from $n=1$ to $n=9$, there is one 1. $C(99) =20, C(100)=21$, etc. I was able to get, as I stated, that from 1 to 99, there are 20 1s. From 1 to 199, $100 + 20*2$, up to 999 there are these $140 + 8*20 = 300$. Keeping with this algorithm I get $C(9,999)=4,000, C(99,999)=50,000$, and $C(199,999)=C(200,000)=200,000$
What I seem to be having trouble with is, is this the smallest integer for which $C(n)=n$?