In this paper, we consider two further analogues of the Calkin–Wilf tree and of the Calkin–Wilf sequence. We first consider (p,q)-versions of these whereby we show that a two-variable generalization of the latter is given, equivalently, in terms of a generalization of the former. In particular, we show that the sequence of (p,q)-generating functions counting the hyperbinary expansions of n according to the total number of distinct powers used and the number of powers used twice arises as the sequence of numerators for the rational functions which label the vertices of our (p,q)-Calkin–Wilf tree. We also define a k-dimensional q-generalization of the Calkin–Wilf tree and of the Calkin–Wilf sequence. Having defined the n-th term of the latter in terms of the generating function counting the hyper k-expansions of n according to the number of powers that are used exactly k times, we show that it is given equivalently in terms of the former.
|Number of pages||18|
|Journal||Journal of Combinatorics|
|State||Published - 2011|