On the Number of Words of Length $N$ over a Three-Letter Alphabet

Abstract

We study the classical problem of counting words formed from a three-letter alphabet by classifying them according to the residues modulo three of both the total length and the multiplicities of each letter. This approach yields explicit formulas for all cases and, as a consequence, several identities involving sums of trinomial coefficients.

7 pages