Article contents
A VARIANT OF HOFSTADTER’S SEQUENCE AND FINITE AUTOMATA
Published online by Cambridge University Press: 03 May 2013
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright ©2013 Australian Mathematical Publishing Association Inc.
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151127061355866-0657:S1446788713000074_inline3.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151127061355866-0657:S1446788713000074_inline4.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151127061355866-0657:S1446788713000074_inline5.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20151127061355866-0657:S1446788713000074_inline6.gif?pub-status=live)
- 6
- Cited by