A variant of Hofstadter's sequence and finite automata
classification
🧮 math.NT
cs.DMcs.FL
keywords
hofstadtersequencevariantanalyzeautomataautomaticautomatonbalamohan
read the original abstract
Following up on a paper of Balamohan, Kuznetsov, and Tanny, we analyze a variant of Hofstadter's Q-sequence and show it is 2-automatic. An automaton computing the sequence is explicitly given.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.