A family of meta-Fibonacci sequences defined by variable order recursions
Abstract
We define a family of meta-Fibonacci sequences where the order of the of recursion at stage n is a variable r(n), and the nth term of a sequence is the sum of the previous r(n) terms. For the terms of any such sequence, we give upper and lower bounds which depend only on r(n).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.