discrete mathematics - Finding a closed form formula for a recursive sequence.

$a_0 = 1, a_1 = 3$ and

$a_n = 2a_{n-1} + a_{n-2}$

How do I obtain a closed form for this sequence? We have learned about the method of characteristic roots, but I am unsure how to take that and turn this into a closed form.