We have a sequence of $a_n = a_{n-3}+a_{n-2}+a_{n-1} \text{ where } a_{1} = a_{2} =a_{3} = 1$ for all $n\ge 4$. Prove $a_n < 2^n$ is true for all positive integers $n$.
What I have done so far is starting with the inductive hypothesis because this is strong induction. So far my inductive hypothesis is: Consider $P(k)$ is true for all $a_k < 2^k$ where $k$ is a positive integer. Now show that $a_{k+1} < 2^{k+1}.$
This is what I have done so far: $$a_{k+1} < 2^{k+1} \implies a_{k+1} < 2^k \cdot 2 \implies 2 \cdot \underbrace{a_k < 2^k}_{IH} \cdot 2 \\ \text{So we see: } a_k < 2^k < 2^{k+1}$$
Now I am stuck because I don't know how to show $a_{k+1} < a_k$.
If my way of solving this looks wrong please let me know.