References
- J. Callaghan, J.J. Chew III, S.M. Tanny, On the behavior of a family of meta-Fibonacci sequences. SIAM J. Discrete Math. 18(4) (2005), pp. 794–824. doi: 10.1137/S0895480103421397
- B. Dalton, M. Rahman and S. Tanny, Spot-based generations for meta-Fibonacci sequences, Experiment. Math. 20(2) (2011), pp. 129–137. doi: 10.1080/10586458.2011.544565
- C. Deugau and F. Ruskey, Complete k-ary trees and generalized meta-Fibonacci sequences, in Fourth Colloquium on Mathematics and Computer Science: Algorithms, trees, Combinatorics and Probabilities. DMTCS Proceedings Series, Nancy, France, 2006, 203–214.
- C. Deugau and F. Ruskey, The combinatorics of certain k-ary meta-Fibonacci sequences, J. Integer Seq. 12(4) (2009), pp. 3. Article 09.4.3.
- S.W. Golomb, Discrete chaos: sequences satisfying “strange” recursions, preprint no date
- J. Higham and S. Tanny, More well-behaved meta-Fibonacci sequences, Congr. Numer. 98 (1993), pp. 2–17.
- J. Higham and S. Tanny, A tamely chaotic meta-Fibonacci sequence, Congr. Numer. 99 (1994), pp. 67–94.
- A. Isgur, Solving nested recursions with trees, Ph.D. diss. University of Toronto, 2012.
- A. Isgur, V. Kuznetsov, M. Rahman and S.M. Tanny, Nested recursions, simultaneous parameters and tree superpositions, Electron. J. Combin. 21(1) (2014), pp. 1–49.
- A. Isgur, V. Kuznetsov and S. Tanny, A combinatorial approach for solving certain nested recursions with non-slow solutions, J. Differ. Equ. Appl. 19 (2012), pp. 605–614. doi: 10.1080/10236198.2012.662967
- 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(2) (2016), pp. 1128–1147. doi: 10.1137/15M1040505
- A. Isgur, M. Rahman and S. Tanny, Solving non-homogeneous nested recursions using trees, Ann. Comb. 17(4) (2013), pp. 695–710. doi: 10.1007/s00026-013-0202-9
- A. Isgur, M.D. Reiss and S. Tanny, Trees and meta-Fibonacci sequences, Electr. J. Comb. 16(1) (2009), pp. R129.
- B.W. Jackson and F. Ruskey, Meta-Fibonacci sequences, binary trees and extremal compact codes, Electr. J. Comb. 13(1) (2006), pp. R26.
- M. Sunohara and S. Tanny, On the solution space of the Golomb recursion, J. Difference Equ. Appl. (2018), DOI: 10.1080/10236198.2018.1471471>