Following up on a paper of Balamohan et al. [‘On the behavior of a variant of Hofstadter’s
$q$-sequence’, J. Integer Seq. 10 (2007)], we analyze a variant of Hofstadter’s
$Q$-sequence and show that its frequency sequence is 2-automatic. An automaton computing the sequence is explicitly given.