Asymptotics of Lagged Fibonacci Sequences

Details Asymptotics of Lagged Fibonacci Sequences Asymptotics of Lagged Fibonacci Sequences

2009-12-12

arxiv.org/abs/0912.2459v1

Mathematics

Combinatorics

9 pages, 4 figures

Scientific paper

Consider "lagged" Fibonacci sequences $a(n) = a(n-1)+a(\lfloor n/k\rfloor)$
for $k > 1$. We show that $\lim_{n\to\infty} a(kn)/a(n)\cdot\ln n/n = k\ln k$
and we demonstrate the slow numerical convergence to this limit and how to deal
with this slow convergence. We also discuss the connection between two
classical results of N.G. de Bruijn and K. Mahler on the asymptotics of $a(n)$.

Affiliated with

Also associated with

No associations

Rating

Asymptotics of Lagged Fibonacci Sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotics of Lagged Fibonacci Sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotics of Lagged Fibonacci Sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556463