Article ID Journal Published Year Pages File Type
4656140 Journal of Combinatorial Theory, Series A 2011 9 Pages PDF
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.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics