Let $a_n$ be the number of ternary strings of length $n$ using $\{0, 1, 2\}$ such that no two adjacent digits are equal. What is the closed form of $a_n$ for $n \geq 1$?