We can represent any increasing (not necessarily strictly-increasing) decimal number via binary strings and vice versa.
Let, for example 001101001 represent 2235.
HOW?
Imagine a counter C, which starts at 0.
Our sequence is 001101001. Moving from left to right for every 0 we meet in the string we increase C by one, and for every 1 we meet in the string we print the value of C.
Thus we get this number 2235.
Using this method we can represent all 3-digit increasing(see my definition above) numbers made up of the digits 0,1, and 2 with binary strings of length 5:
11100 = 000
11010 = 001
11001 = 002
etc
....
etc,etc
00111 = 222
Which means that there are 10 5-digit strings covering all increasing numbers from 000 to 222.
How many k-digit (k denotes the length) binary strings are needed to cover all increasing numbers from 0 to n?
Your answer should be definition of F(n,k) and the justification of this formula.
Rem:Clearly, the maximum value of C is 9.
D3 bonus: Devise a doable notation for non-decimal numbers (say base up to 24 implying C over 9).
What are the first several terms in the following sequential set.
... (29,11,5), (37,8,4), (46,8,3), (56,10,6) ...
Latest: 
Bonus: 
