Properties of k-Descending Trees

Agniv Sarkar, Eric Severson

For any real-valued $k>1$, we consider the tree rooted at 0, where each positive integer $n$ has parent $\lfloor \frac{n}{k}\rfloor$. The average number of children per node is $k…