Structure and Growth of Galileo Sequences

A Galileo sequence $(a_n)$ is a sequence of positive integers whose partial sums $S_n$ satisfy $S_{2n}=k{S}_n$ for some $k>1$. In this paper we prove that every polynomial Galileo sequence is given by first differences of the form $a_n=C(n^d-(n-1{)}^d)$. We then show that every positive Galileo sequence has a binary-tree representation. Finally, for positive monotone integer-valued Galileo sequences, we prove power-law growth bounds, and give a continuous analog together with a characterization of all continuous solutions.