Mirroring and interleaving in the paperfolding sequence
Bruce Bates, Martin W. Bunder, Keith P. Tognetti · Applicable Analysis and Discrete Mathematics · 2010
Three equivalent methods of generating the paperfolding sequence are presented as well as a categorization of runs of identical terms. We find all repeated subsequences, the largest repeated subsequences and the spacing of singles, doubles and triples throughout the sequence. The paperfolding sequence is shown to have links to the Binary Reflected Gray Code and the Stern-Brocot tree.