On completely multiplicative automatic sequences
Combinatorics
2019-11-28 v3 Number Theory
Abstract
In this article we prove that all completely multiplicative automatic sequences defined on , vanishing or not, can be written in the form where is an almost constant sequence, and is a Dirichlet character.
Cite
@article{arxiv.1903.04385,
title = {On completely multiplicative automatic sequences},
author = {Shuo Li},
journal= {arXiv preprint arXiv:1903.04385},
year = {2019}
}