A variant of Hofstadter's sequence and finite automata
arXiv:1103.1133
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.