Diagonalization & Matrix Powers · Superchallenge problem

How many strings of length $10$ made from the digits $0, 1, 2$ have every two neighbouring digits differing by at most $1$ (so a $0$ is never next to a $2$)?