Powers of general digital sums (Q606280)

Let \((m_i)_{i\geq 0}\) be integers, all \(\geq 2\). Every integer \(n\geq 1\) can be uniquely represented in the form \[ n=a_0+a_1 m_0+a_2m_0m_1+\ldots+a_tm_0\cdot\ldots\cdot m_{t-1}, \] with \(0\leq a_i\leq m_i-1 \) for all \(i\) and \(a_t\neq 0\). Let \(f_i\) be a function defined on \(\{0,1,\ldots,m_i-1\} \) with \(f_i(0)=0\), and let \[ S(n)=\sum_{i=0}^t f_i(a_i). \] The author proves that for \(x>1\) \[ \frac{1}{x}\sum_{n\leq x}S(n)^k=\left(\sum_{i=0}^{\omega-1}\frac{1}{m_i}\sum_{j=0}^{m_i-1}f_i(j)\right)^k+O_k(C^k\omega^{k-1}) , \] \(k>0 \) an integer, \(\omega \) an integer with \[ m_0\ldots m_{\omega-1}<x\leq m_0\ldots m_{\omega}, \] \[ C=\max \{|f_i(j)|+1:j=0,1,\ldots,m_i-1,i=0,1,\ldots,\omega\}. \]