Abstract
We define a q-analogue of the Calkin-Wilf tree and the Calkin-Wilf sequence. We show that the nth term f(n;q) of the q-analogue of the Calkin-Wilf sequence is the generating function for the number of hyperbinary expansions of n according to the number of powers that are used exactly twice. We also present formulae for branches within the q-analogue of the Calkin-Wilf tree and predecessors and successors of terms in the q-analogue of the Calkin-Wilf sequence.
| Original language | English |
|---|---|
| Pages (from-to) | 1143-1151 |
| Number of pages | 9 |
| Journal | Journal of Combinatorial Theory. Series A |
| Volume | 118 |
| Issue number | 3 |
| DOIs | |
| State | Published - Apr 2011 |
Keywords
- Calkin-Wilf sequence
- Calkin-Wilf tree
- Hyperbinary expansion
- Q-Analogue
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'The q-Calkin-Wilf tree'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver