WeBWorK using host: https://webwork-dev.aimath.org, format: simple, seed: 122, course: anonymous

Consider the recurrence relation $a_n = 3a_{n-1} + 10 a_{n-2}$ with first two terms $a_0 = 1$ and $a_1 = 2\text{.}$

Write out the first 5 terms of the sequence defined by this recurrence relation.
$a_2 =$
, $a_3 =$
, $a_4 =$
, ...

Solve the recurrence relation. That is, find a closed formula for $a_n\text{.}$
$a_n =$