Abstract
Let , where is the sum of binary digits function. The sequence is the well-known Prouhet–Thue–Morse sequence. In this note we study the sequence , where and for we define recursively as follows: . We prove several results concerning arithmetic properties of the sequence . In particular, we prove non-vanishing of for , automaticity of the sequence for each m, and other results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
