0
This used to be an old Computer Olympiad Question, not sure what the actual source was.
Assume function f:
f(1) = 1
This f(1), f(2), f(3), f(4), ... sequence of numbers are in ascending order.
Number n has been repeated f(n) times
Here is the sequence up to the fifteenth number:
n : 1 2...