Photo from archive.org
In this article we prove that all completely multiplicative automatic sequences $(a_n)_{n \in \mathbf{N}}$ defined on $\mathbf{C}$, vanishing or not, can be written in the form $a_n=b_n\chi_n$ where $(b_n)_{n \in… Click to show full abstract
In this article we prove that all completely multiplicative automatic sequences $(a_n)_{n \in \mathbf{N}}$ defined on $\mathbf{C}$, vanishing or not, can be written in the form $a_n=b_n\chi_n$ where $(b_n)_{n \in \mathbf{N}}$ is an almost constant sequence, and $(\chi_n)_{n \in \mathbf{N}}$ is a Dirichlet character.
Keywords:
completely multiplicative;
multiplicative automatic;
automatic sequences
Journal Title: Journal of Number Theory
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Number Theory
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!