Results 211 to 220 of about 78,268 (260)
Some of the next articles are maybe not open access.

New Recurrences on Pell Numbers, Pell-Lucas Numbers, Jacobsthal Numbers, and Jacobsthal-Lucas Numbers

Chaos, Solitons and Fractals, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Engin Özkan, Songül Çelik
exaly   +2 more sources

Lucas Numbers and Determinants

Integers, 2012
Abstract.In this article, we present two infinite dimensional matrices whose entries are recursively defined, and show that the sequence of their principal minors form the Lucas sequence, that ...
Alireza Moghaddamfar, Hadiseh Tajbakhsh
openaire   +3 more sources

On the Order-k Generalized Lucas Numbers

Applied Mathematics and Computation, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dursun Taşci̧, Emrah Kilic
exaly   +3 more sources

Optimization by k-Lucas numbers

Applied Mathematics and Computation, 2008
The well-known Fibonacci search method to find the maximum point of unimodal functions on closed intervals is modified by using \(k\)-Lucas numbers. This makes the Fibonacci search method more effective and improves an earlier algorithm by \textit{B. Yildiz} and \textit{E. Karaduman} [Appl. Math. Comput. 143, No. 2--3, 523--551 (2003; Zbl 1041.11013)].
Ali Demir   +2 more
openaire   +4 more sources

Sums of Pell/Lucas Polynomials and Fibonacci/Lucas Numbers

open access: yesMathematics, 2022
Seven infinite series involving two free variables and central binomial coefficients (in denominators) are explicitly evaluated in closed form. Several identities regarding Pell/Lucas polynomials and Fibonacci/Lucas numbers are presented as consequences.
Dongwei Guo, Wenchang Chu
exaly   +3 more sources

On Concatenations of Fibonacci and Lucas Numbers

Bulletin of the Iranian Mathematical Society, 2022
Let \( (F_n)_{n\ge 0} \) and \( (L_n)_{n\ge 0} \) be the usual Fibonacci and Lucas sequences defined respectively by the linear recurrence relations: \( F_0=0 \), \( F_1=1 \), \( F_{n+2}=F_{n+1}+F_n \) and \( L_0=2 \), \( L_1=1 \), \( L_{n+2}=L_{n+1}+L_n \) for all \( n\ge 0 \).
openaire   +2 more sources

Home - About - Disclaimer - Privacy