On the number of words of $N=3n$ letters with a three-letter alphabet

Pablo Serra

In this paper we address the well-known problem of counting the number of $3n$-letter words that can be formed from a three-letter alphabet by decomposing it into four possible cas…