The sequence (wn\displaystyle {w}_{{n}}) is generated using a recursion rule similar to the Fibonacci
wn+1=2wn+wn1\displaystyle {w}_{{{n}+{1}}}={2}\cdot{w}_{{n}}+{w}_{{{n}-{1}}}.
Notice that the coefficients in the recurssion rule are not all equal to 1. The initial conditions for this sequence are w0=0\displaystyle {w}_{{0}}={0} and w1=3\displaystyle {w}_{{1}}={3}.

What are the next five values in this sequence?
w2\displaystyle {w}_{{2}} =
w3\displaystyle {w}_{{3}} =
w4\displaystyle {w}_{{4}} =
w5\displaystyle {w}_{{5}} =
w6\displaystyle {w}_{{6}} =