Results 61 to 70 of about 187 (159)
Periods of Leonardo Sequences and Bivariate Gaussian Leonardo Polynomials
In this study, we investigate the periodic characteristics of Leonardo, Leonardo-Lucas, and Gaussian Leonardo sequences, presenting our findings through lemmas and theorems.
Selime Beyza Özçevik, Abdullah Dertli
doaj +1 more source
COMMON TERMS k-GENERALIZED FIBONACCI AND LUCAS SEQUENCES
Let (F_n^((k))) and (L_n) be the k-generalized Fibonacci and Lucas sequences. In this study, we find k-generalized Fibonacci numbers which are Lucas numbers. Namely, we tackle the Diophantine equation F_n^((k))=L_m, in non-negative integers k,n,m with k≥3.
openaire +1 more source
The art of painting chromosome loops. [PDF]
Berr A, Chabouté ME.
europepmc +1 more source
On Sequences of Numbers and Polynomials Defined by Linear Recurrence Relations of Order 2
Here we present a new method to construct the explicit formula of a sequence of numbers and polynomials generated by a linear recurrence relation of order 2.
Tian-Xiao He, Peter J.-S. Shiue
doaj +1 more source
On prime powers in linear recurrence sequences. [PDF]
Odjoumani J, Ziegler V.
europepmc +1 more source
Generalizations of Fibonacci and Lucas sequences
The author studies the Hecke group \(H(\sqrt q)\) (\(q\) a prime \(\geq 5\)), the subgroup of \(\text{PSL}(2, \mathbb{Z})\) generated by \(z \to {- {1/z}}\) and \(z \to {z + \sqrt q}\). This group can also be generated by \(z \to {- {1/z}}\) and an element \(S\) whose matrix representation is \[ \left(\begin{matrix} 0 & {-1} \\ 1 & {\sqrt q} \end ...
openaire +4 more sources
DETERMINANTAL IDENTITIES FOR k LUCAS SEQUENCE
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 +1 more
doaj
Fibonacci and Lucas Sequences in Aperiodic Monotile Supertiles
10 pages, 21 ...
openaire +2 more sources
On the connections between Fibonacci and Mulatu Numbers
In this work, we present a detailed study of the Fibonacci--Mulatu sequence, {FMn}, defined recursively by FMn+2=FMn+1+FMn with initial terms FM0 = 4 and FM1 = 1.
Eudes Antonio Costa +2 more
doaj +1 more source
KmerKeys: a web resource for searching indexed genome assemblies and variants. [PDF]
Pavlichin DS +5 more
europepmc +1 more source

