Question: 5. For all n E N, let to be the number of {a, b, c}-strings of length n not having abc as a substring. For

5. For all n E N, let to be the number of {a, b, c}-strings of length n not having abc as a substring. For example, if n = 8, cbacabac is allowed, but not ababcaab. Find the generating function of (tn)=1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
