There is not enough information to determine the answer. The simplest explanation is that the sequence is:
$5,6,8,11,45,74,101,101,101,101,\cdots$ (remaining constant all the way)
The reason is that any other explanation will almost certainly require a longer description of the sequence than this one. So by Occam's razor this one would be preferable.
My answer can be easily made mathematically precise via information theory, specifically one can define Kolmogorov complexity. To be fair we cannot choose a language specially designed for a particular answer otherwise its complexity can be made to be arbitrarily small. If we hence choose any mainstream Turing complete language we will almost certainly find that the sequence I gave above has the smallest program generating it.