Greetings. I come with another question: How can I define a recurrence relation for the following problem?
"Write a recurrence relation for the number of n-letter words in which no consecutive pair of 'e's appear."
My initial guess (though I feel shakey about it) is that, assuming that the first letter is **not** an e, then there would be $25a_{n-1}$ sub-sequences for the remaining $n-1$ letters in the sequence (that satisfy the requirement). However, if it **is** an e, then there would be $a_{n-1}$ valid sub-sequences for the remaining letters. This would give me the relation $a_n=25a_{n…