Find the recurrence for the number of ways to color the vertices of a cycle graph $C_n$ with 3 colors such that no two adjacent vertices have the same color.