How can we find a recurrence relation for the number of strings of length $n$ in base $3$ such that the number of $1$'s and $2$'s are odd?
Recurrence relation for the number of strings of length $n$ in base $3$
0
$\begingroup$
discrete-mathematics
recurrence-relations
generating-functions