Question 74
The language of Au tribe contains only two letters $a$ and $u$. Some sequences of these letters are words, and each word contains not less than $1$ and not more than $13$ letters. Moreover, if one writes down two words consecutively (with no space between them) then the resulting sequence is never a word. Find the maximal possible number of words in such language. (I. Bogdanov)