Results 51 to 60 of about 183 (115)

A Sequence Bounded Above by the Lucas Numbers

Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2018
In this work, we consider the sequence whosenthterm isthe number of h-vectors of length n. The set of integer vectors E(n)isintroduced. For, n>=2,the cardinality ofE(n)is the nthLucasnumber Lnisshowed.
Ali Aydoğdu, Engin Özkan, Aykut Göçer   +2 more
doaj   +1 more source

A Matrix Approach for Divisibility Properties of the Generalized Fibonacci Sequence

Discrete Dynamics in Nature and Society, 2013
We give divisibility properties of the generalized Fibonacci sequence by matrix methods. We also present new recursive identities for the generalized Fibonacci and Lucas sequences.
Aynur Yalçiner
doaj   +1 more source

Decomposition of terms in Lucas sequences

Journal of Logic and Analysis, 2009
Let N be any large integer. Proceeding directly to the factorization of N is not an easy task, even unfeasible unless N belongs to a particular family of integers. Then to surmount this major difficulty we might choose to ask about the factorization of an integer in a small neighborhood of N instead of N .
openaire   +3 more sources

On squares in Lucas sequences

Journal of Number Theory, 2007
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-
Bremner, A., Tzanakis, N.
openaire   +3 more sources

A Graph-Theoretic Encoding of Lucas Sequences

The Fibonacci Quarterly, 2015
Some well-known results of Prodinger and Tichy are that the number of independent sets in the $n$-vertex path graph is $F_{n+2}$, and that the number of independent sets in the $n$-vertex cycle graph is $L_n$. We generalize these results by introducing new classes of graphs whose independent set structures encode the Lucas sequences of both the first ...
Alexander, James, Hearding, Paul
openaire   +2 more sources

Gessel–Lucas congruences for sporadic sequences

Monatshefte für Mathematik, 2023
17 ...
openaire   +2 more sources

DETERMINANTAL IDENTITIES FOR k LUCAS SEQUENCE

Journal of New Theory, 2016
Abstaract−In this paper, we defined new relationship between k Lucas sequences and determi- nants of their associated matrices, this approach is different and never tried in k Fibonacci sequence ...
Ashok Dnyandeo Godase, Machindra Baban Dhakne   +1 more
doaj  

On Diophantine equations involving Lucas sequences

Open Mathematics, 2019
In this paper, we shall study the Diophantine equation un = R(m)P(m)Q(m), where un is a Lucas sequence and R, P and Q are polynomials (under weak assumptions).
Trojovský Pavel
doaj   +1 more source

On some identities for the DGC Leonardo sequence [PDF]

Notes on Number Theory and Discrete Mathematics
In this study, we examine the Leonardo sequence with dual-generalized complex (DGC) coefficients for 𝔭∈ℝ. Firstly, we express some summation formulas related to the DGC Fibonacci, DGC Lucas, and DGC Leonardo sequences.
Çiğdem Zeynep Yılmaz, Gülsüm Yeliz Saçlı   +1 more
doaj   +1 more source

Primes in shifted sums of Lucas sequences

Integers, 2017
See the abstract in the attached pdf.
Lenny Jones, Lawrence Somer
openaire   +3 more sources