https://orcid.org/0000-0002-9958-7547
References
- B. Balamohan, A. Kuznetsov, and S. Tanny, On the behavior of a variant of Hofstadter's Q-sequence, J. Integer Seq. 10 (2007), p. 29.
- B. Conolly, Meta-Fibonacci sequences, Chapter XII in S. Vajda, Fibonacci & Lucas numbers, and the golden section (1989)
- M. Drmota and J. Gajdosik, The parity of the sum-of-digits-function of generalized Zeckendorf representations, Fibonacci Quart. 36 (1998), pp. 3–19.
- A. Erickson, A. Isgur, B.W. Jackson, F. Ruskey, and S.M. Tanny, Nested recurrence relations with Conolly-like solutions, SIAM J. Discrete Math. 26 (2012), pp. 206–238.
- N. Fox, Linear recurrent subsequences of generalized meta-Fibonacci sequences, J. Difference Equ. Appl. (2016), pp. 1019–1026.
- N. Fox, Quasipolynomial solutions to the Hofstadter Q-recurrence, Integers 16 (2016), p. A68.
- N. Fox, A slow relative of Hofstadter's Q-sequence, J. Integer Seq. 20 (2017), p. 3.
- N. Fox, Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation, J. Symbolic Comput. 87 (2018), pp. 99–126.
- N. Fox, A new approach to the Hofstadter Q-recurrence, Integers 20A (2020), pp. A8.
- S. Golomb, Discrete chaos: Sequences satisfying “Strange” recursions (1991)
- D. Hofstadter, Gödel, Escher, Bach: An Eternal Golden Braid, Basic Books, New York, 1979.
- A. Isgur, Solving nested recursions with trees, Ph.D. diss., University of Toronto, 2012.
- A. Isgur, D. Reiss, and S. Tanny, Trees and meta-Fibonacci sequences, Electron. J. Combin. 16 (2009), p. 1.
- A. Isgur, V. Kuznetsov, and S.M. Tanny, A combinatorial approach for solving certain nested recursions with non-slow solutions, J. Differ. Equ. Appl. 19 (2013), pp. 605–614.
- A. Isgur, M. Rahman, and S. Tanny, Solving non-homogeneous nested recursions using trees, Ann. Comb. 17 (2013), pp. 695–710.
- A. Isgur, V. Kuznetsov, M. Rahman, and S. Tanny, Nested recursions, simultaneous parameters and tree superpositions, Electron. J. Combin. 21 (2014), p. P49.
- A. Isgur, R. Lech, S. Moore, S. Tanny, Y. Verberne, and Y. Zhang, Constructing new families of nested recursions with slow solutions, SIAM J. Discrete Math. 30 (2016), pp. 1128–1147.
- C.L. Mallows, Conway's challenge sequence, Amer. Math. Monthly 98 (1991), pp. 5–20.
- S.J. Miller and Y. Wang, From Fibonacci numbers to central limit type theorems, J. Combin. Theory Ser. A 119 (2012), pp. 1398–1413.
- K. Pinn, Order and chaos in Hofstadter's Q (n) sequence, Complexity 4 (1999), pp. 41–46.
- V.V. Prasolov, Polynomials, Vol. 11, Springer Science & Business Media, Berlin, 2009.
- F. Ruskey, Fibonacci meets Hofstadter, Fibonacci Quart. 49 (2011), pp. 227–230.
- F. Ruskey and C. Deugau, The combinatorics of certain k-ary meta-Fibonacci sequences, J. Integer Seq. 12 (2009), p. 3.
- N. Sloane, OEIS Foundation Inc. (2018). Available at http://oeis.org/.
- M. Sunohara, S. Tanny, and Y. Verberne, A combinatorial approach for constructing non-monotonic solutions to the generalized Golomb recursion, J. Differ. Equ. Appl. 25 (2019), pp. 481–503.
- S.M. Tanny, A well-behaved cousin of the Hofstadter sequence, Discrete Math. 105 (1992), pp. 227–239.
- E. Zeckendorf, Représentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas, Bull. Soc. Roy. Sci. Liège 41 (1972), pp. 179–182.