Forgot password? New user? Sign up
Existing user? Log in
A string of nnn characters is made from the characters A\text{A}A, B\text{B}B, and C\text{C}C.
Let GnG_nGn be the number of such strings of nnn characters which contain no instance of AB\text{AB}AB (in that order).
Write a recurrence relation for GnG_nGn.
Problem Loading...
Note Loading...
Set Loading...