arXiv (All)
open access
On the Number of Words of Length $N$ over a Three-Letter Alphabet
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 identiti
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Number words as number names#754521
- On the representation number of chessboard graphs#1036994
- Fibonacci Enumeration of Residue Classes via Forbidden Binary Factors#1156121
- NBR ИНДЕКСІ МЕН ТЕРМАЛДЫ НҮКТЕЛЕРДІ ҚОЛДАНА ОТЫРЫП ДАЛА ЖӘНЕ ОРМАН ӨРТТЕРІН БАҚЫЛАУ#191309
- Uniform Factor-Balancedness in Arnoux-Rauzy Words#1118992
Record · ID 1104932
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive