Some fascinating integer sequences (Q1199616)

The authors study the set of integers defined as follows: let \(m\) be a positive integer (the set of positive integers is called \(\mathbb{P}\) by the authors instead of the usual notation), define \(\alpha_ m(x,y)=mx+my\), \(x,y\in\mathbb{Z}\), and let \(A_ m\) be the smallest set of integers containing 1 and such that \(x,y\in A_ m\Rightarrow \alpha_ m(x,y)\in A_ m\). The authors show in a rather tricky way that \(A_ m\) (and related sets) has an asymptotic density which can be computed explicitly. Moreover they show that \(A_ m\) is \(m\)-recognizable in the sense of Cobham: its characteristic function can be generated by an \(m\)-automaton (uniform tag-system of modulus \(m\)). The proofs for both results are written in detail only in a particular case. Note that the densities computed in the examples given by the authors are rational numbers, which is a consequence of the \(m\)- recognizability [this is a theorem of \textit{A. Cobham}, in Math. Syst. Theory 6, 164-192 (1972; Zbl 0253.02029)]. Note also that \(\langle \gamma_ m:1\rangle\) page 307 line 25 should read \(\langle \gamma_ m:0\rangle\).