Question 13
An alphabet has $n$ letters. A word contains a palindrome if a consecutive substring of more than one letter reads identically forwards and backwards. For example OLIMPIADAS contains ADA. For an integer $k\gt2$, how many length-$k$ words contain no odd-length palindrome?