How many words with $N$-characters can be formed from the numbers $\{0, 1, 2\}$, such that adjacent numbers have maximum difference 1?
In how many sequences of length $n$, the difference between every 2 adjacent elements is $1$ or $-1$?