arXiv (All)
open access
Fibonacci Enumeration of Residue Classes via Forbidden Binary Factors
Binary words avoiding adjacent ones are counted by Fibonacci numbers. We identify a natural residue-class enumeration in which this classical word count arises from parity data of the shortcut $3n+1$ map. For an odd starting value, we introduce a local cut time: the first index at which the trajecto
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
- On the Number of Words of Length $N$ over a Three-Letter Alphabet#1104932
- A Epistemologia Numérica de Filolau#91795
- On the measure of definable sets in profinite groups#1061088
- Identification of possible differences in coding and non coding fragments of DNA sequences by using the method of the Recurrence Quantification Analysis#711782
- Quantitative parsimony#757253
Record · ID 1156121
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