Question

let T be the set of strings over the alphabet {0,1,2,3} which do not contain 12 as a substring. Give the recursion for the number h(n) of strings T of length n. Make sure to give initial values to get the recursion going.