(non)-automaticity of completely multiplicative sequences having negligible many non-trivial prime factors
Shuo Li · arXiv (Cornell University) · 2017
In this article we consider the completely multiplicative sequences $(a_n)_{n \in \mathbf{N}}$ defined on a field $\mathbf{K}$ and satisfying $$\sum_{p| p \leq n, a_p eq 1, p \in \mathbf{P}}\frac{1}{p}