Results 21 to 30 of about 248,402 (331)
Horadam introduced a generalized sequence of numbers, describing its key features and the special sub-sequences obtained from specific choices of initial parameters. This sequence and its sub-sequences are known as the Horadam, generalized Fibonacci, and generalized Lucas numbers, respectively.
openaire +2 more sources
Oscillatory Nonautonomous Lucas Sequences [PDF]
The oscillatory behavior of the solutions of the second‐order linear nonautonomous equation x(n + 1) = a(n)x(n) − b(n)x(n − 1), n ∈ ℕ0, where a, b : ℕ0 → ℝ, is studied. Under the assumption that the sequence b(n) dominates somehow a(n), the amplitude of the oscillations and the asymptotic behavior of its solutions are also analized.
Ferreira, José M., Pinelas, Sandra
openaire +3 more sources
Let P and Q be non-zero integers. The Lucas sequence U_n(P,Q) is defined by U_0=0, U_1=1, U_n= P*U_{n-1}-Q*U_{n-2} for n >1. The question of when U_n(P,Q) can be a perfect square has generated interest in the literature. We show that for n=2,...,7, U_n is a square for infinitely many pairs (P,Q) with gcd(P,Q)=1; further, for n=8,...,12, the only non-
Andrew Bremner, Nikos Tzanakis
openaire +3 more sources
Prime divisors of Lucas sequences [PDF]
Let \(d>1\) be a squarefree integer and \(\mathbb{K}= \mathbb{Q}(\sqrt{d})\) a real quadratic field. Let \(\varepsilon= a+b\sqrt{d}\) be a fundamental unit in the ring of integers of \(\mathbb{K}\), and \(\overline{\varepsilon}\) its conjugate. The Lucas sequence associated with \(\mathbb{K}\) is the integer sequence defined by \[ X_{\mathbb{K ...
Stevenhagen, P., Moree, P.
openaire +3 more sources
On the reciprocal products of generalized Fibonacci sequences
In this paper, we use the properties of error estimation and the analytic method to study the reciprocal products of the bi-periodic Fibonacci sequence, the bi-periodic Lucas sequence, and the mth-order linear recursive sequence.
Tingting Du, Zhengang Wu
doaj +1 more source
A method to decrease computation time for fourth order Lucas sequence [PDF]
The fourth order Lucas sequence is a linear recurrence relation related to quartic polynomial and based on Lucas function. This sequence had been used to develop the LUC4,6 cryptosystem.
Koo, Lee Feng +3 more
core +1 more source
On some new results for the generalised Lucas sequences
In this paper we introduce the functions which count the number of generalized Lucas and Pell-Lucas sequence terms not exceeding a given value x and, under certain conditions, we derive exact formulae (Theorems 3 and 4) and establish asymptotic limits ...
Andrica Dorin +2 more
doaj +1 more source
Repdigits as difference of two Fibonacci or Lucas numbers
In the present study we investigate all repdigits which are expressed as a difference of two Fibonacci or Lucas numbers. We show that if $F_{n}-F_{m}$ is a repdigit, where $F_{n}$ denotes the $n$-th Fibonacci number, then $(n,m)\in \{(7,3),(9,1),(9,2 ...
P. Ray, K. Bhoi
doaj +1 more source
Additional Fibonacci-Bernoulli relations
We continue our study on relationships between Fibonacci (Lucas) numbers and Bernoulli numbers and polynomials. The derivations of our results are based on functional equations for the respective generating functions, which in our case are combinations ...
K. Adegoke, R. Frontczak, T.P. Goy
doaj +1 more source
A method for computing Lucas sequences
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chin-Chen Chang +2 more
openaire +2 more sources

