# Double Trouble

Let $$x_0, x_1, x_2, x_3, \ldots$$ be positive integers satisfying the recursive relation,

$x_{n+1} > 2 \times x_n .$

How many ways are there to pick $$x_0$$ through $$x_3$$ such that $$x_3 < 51$$?

×