Asymptotics of Lagged Fibonacci Sequences (original) (raw)
Related papers
The asymptotic behavior of a family of sequences
Pacific Journal of Mathematics, 1987
A class of sequences defined by nonlinear recurrences involving the greatest integer fuuction is studied, a typical member of the class being a(0) = 1, a(n) = cz([n/2]) + a(ln/3]) + n(~n/6]) for n r 1. For this sequence, it is shown that lim a(n)/n as n + M exists and equals 12/oog 432). More generally, for any sequence defined by a(0) = 1, a(n) = i qa(ln/m,J) fern 2 1, i-l where the r, > 0 and the m, are integers 2 2, the asymptotic behavior of a(n) is detennhed.
ACCELERATIONS OF GENERALIZED FIBONACCI SEQUENCES
In this paper we study how to accelerate the convergence of the ratios (xn) of generalized Fibonacci sequences. In particular, we provide recurrent formulas in order to generate subsequences (xg n ) for every linear recurrent sequence (gn) of order 2. Using these formulas we prove that some approximation methods, as secant, Newton, Halley and Householder methods, can generate subsequences of (xn). Moreover, interesting properties on Fibonacci numbers arise as an application. Finally, we apply all the results to the convergents of a particular continued fraction which represents quadratic irrationalities.
3 Accelerations of Generalized Fibonacci Sequences
2016
In this paper we study how to accelerate the convergence of the ratios (xn) of generalized Fibonacci sequences. In particular, we provide recurrent formulas in order to generate subsequences (xg n) for every linear recurrent sequence (gn) of order 2. Using these formulas we prove that some approximation methods, as secant, Newton, Halley and Householder methods, can generate subsequences of (xn). Moreover, interesting properties on Fibonacci numbers arise as an application. Finally, we apply all the results to the convergents of a particular continued fraction which represents quadratic irrationalities.
EFFECTIVE ASYMPTOTICS FOR SOME NONLINEAR RECURRENCES AND ALMOST DOUBLY-EXPONENTIAL SEQUENCES
We develop a technique to compute asymptotic expansions for recurrent sequences of the form a n+1 = f (an), where f (x) = x − ax α + bx β + o(x β ) as x → 0, for some real numbers α, β, a, and b satisfying a > 0, 1 < α < β. We prove a result which summarizes the present stage of our investigation, generalizing the expansions in [Amer. Math Monthly, Problem E 3034[1984, 58], Solution [1986, 739]]. One can apply our technique, for instance, to obtain the formula:
Two Aspects of a Generalized Fibonacci Sequence
Journal of the Indonesian Mathematical Society, 2015
In this paper we study the so-called generalized Fibonacci sequence: x n+2 = αx n+1 + βxn, n ∈ N. We derive an open domain around the origin of the parameter space where the sequence converges to 0. The limiting behavior on the boundary of this domain are: convergence to a nontrivial limit, k-periodic (k ∈ N), or quasi-periodic. We use the ratio of two consecutive terms of the sequence to construct a rational approximation for algebraic numbers of the form: √ r, r ∈ Q. Using a similar idea, we extend this to higher dimension to construct a rational approximation for 3 a + b √ c + 3 a − b √ c + d.
On The Properties of Fibonacci-Like Sequence
2016
In this article, we introduce a new generalization of Fibonacci sequence and we call it as k-Fibonacci-Like sequence. After that we obtain some fundamental properties for k-Fibonacci-Like sequence and also we present some relations among k-Fibonacci-Like sequence, k-Fibonacci sequence and k-Lucas sequence by some algebraic methods. MSC: 11B37, 11B39.
A family of meta-Fibonacci sequences defined by variable order recursions
2005
We define a family of meta-Fibonacci sequences. For each sequence in the family, the order of the of the defining recursion at the n th stage is a variable r(n), and the n th term is the sum of the previous r(n) terms. Given a sequence of real numbers that satisfies some conditions on growth, there is a meta-Fibonacci sequence in the family that grows at the same rate as the given sequence. In particular, the growth rate of these sequences can be exponential, polynomial, or logarithmic. However, the possible asymptotic limits of such a sequence are restricted to a class of exponential functions. We give upper and lower bounds for the terms of any such sequence, which depend only on r(n). The Narayana-Zidek-Capell sequence is a member of this family. We show that it converges asymptotically.
Relationships between Some <i>k</i> -Fibonacci Sequences
Applied Mathematics, 2014
In this paper, we will see that some k-Fibonacci sequences are related to the classical Fibonacci sequence of such way that we can express the terms of a k-Fibonacci sequence in function of some terms of the classical Fibonacci sequence. And the formulas will apply to any sequence of a certain set of k-Fibonacci sequences. Thus we find ′ k-Fibonacci sequences relating to other k-Fibonacci sequences when ′ σ k is linearly dependent of 2 4 2 k k k + + = σ .
Journal of Integer Sequences, 2007
In this note, we study Fibonacci-like sequences that are defined by the recurrence Sk = a, Sk+1 = b, Sn+2 ≡ Sn+1 + Sn (mod n + 2) for all n ≥ k, where k, a, b ∈ N, 0 ≤ a < k, 0 ≤ b < k + 1, and (a, b) 6= (0, 0). We will show that the number α = 0.SkSk+1Sk+2 · · · is irrational. We also propose a conjecture on the pattern of the sequence {Sn}n≥k.
On the Average Growth of Random Fibonacci Sequences
2007
We prove that the average value of the n-th term of a sequence defined by the recurrence relation g n = |g n−1 ± g n−2 |, where the ± sign is randomly chosen, increases exponentially, with a growth rate given by an explicit algebraic number of degree 3. The proof involves a binary tree such that the number of nodes in each row is a Fibonacci number.