A monotonicity property for generalized Fibonacci sequences

Abstract

Given k>1, let an be the sequence defined by the recurrence an=c1an-1+c2an-2+...+ckan-k for n>=k, with initial values a0=a1=...=ak-2=0 and ak-1= 1. We show under a couple of assumptions concerning the constants ci that the ratio of the n-th root of an to the (n-1)-st root of an-1 is strictly decreasing for all n>=N, for some N depending on the sequence, and has limit 1. In particular, this holds in the cases when all of the ci are unity or when all of the ci are zero except for the first and last, which are unity. Furthermore, when k=3 or k=4, it is shown that one may take N to be an integer less than 12 in each of these cases.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…