A family of meta-Fibonacci sequences defined by variable order recursions
Nathaniel D. Emerson
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).
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell