I don't get it. What would be an acceptable rule for this sequence?
That's the issue mentioned across most of the posts. There isn't really any restriction, so the measure of reasonability is subjective.
Entries obtained by simple calculation (ie + - * / powers, factorials...) and recursion (reference to previous elements) would be good candidates in most cases, but since recursive reference requires predefined starting elements you can always treat more elements as predefined until your scheme fits.
For example you can use the following expression to generate the latter two, if you prepend 100 it also fits for the second, but whether you find that acceptably brief/simple is up to you.
a_(n+1) = 2 * a_n + a_(n-1) + 25 * (n-2) * (-1)^n
a_0 = 100, a_1 = 125, <- these are predefined to make the rest work, so this approach treats them as arbitrary
a_2 = 2 * 125 + 100 + 0 = 350,
a_3 = 2 * 350 + 125 - 25 = 800,
a_4 = 2 * 800 + 350 + 50 = 2000
With that, the following numbers would be 4725(which would have been 8000 in your sequence), 11550, 27700, 67100, 161725,...
But things like "the number of holes in the characters of the Arabic decimal representation" can be taken just as well, and since you only have the beginning of the sequence, any apparent scheme could break at some point.
https://oeis.org/A061419 for example starts much like the Fibonacci sequence, but quickly diverges, following a subjectively uglier formula.