Fibonacci Meets Hofstadter
Frank Ruskey,
Department of Computer Science,
University of Victoria, Canada.
Abstract:
The Hofstatder Q sequence is defined by the recurrence relation
Q(n) = Q(n-Q(n-1))+Q(n-Q(n-2)),
with the initial conditions Q(1) = Q(2) = 1.
Here we prove that other initial conditions can be used that cause the recurrence relation to generate
the Fibonacci sequence.
-
The Fibonacci Quarterly,
49 (2011), no. 3, 227-230.
-
The pdf file.
The postscript file.
-
Please send me a note if
you download one of these files.
It's always nice to know who's reading your papers.
-
Submitted to the Fibonacci Quarterly in early March 2011 and
accepted shortly thereafter.
-
Thanks to Douglas R. Hofstadter for his
comments on an earlier draft of the paper.
-
See OEIS A188670.
-
Selected citations:
Back to list of publications.
