Results 31 to 40 of about 183 (115)
On $k$-Fibonacci balancing and $k$-Fibonacci Lucas-balancing numbers
Karpatsʹkì Matematičnì Publìkacìï, 2021 The balancing number $n$ and the balancer $r$ are solution of the Diophantine equation $$1+2+\cdots+(n-1) = (n+1)+(n+2)+\cdots+(n+r). $$ It is well known that if $n$ is balancing number, then $8n^2 + 1$ is a perfect square and its positive square root is
S.E. Rihane
doaj +1 more source
On Lucas Sequences Computation
Int'l J. of Communications, Network and System Sciences, 2010 This paper introduces an improvement to a currently published algorithm to compute both Lucas "sister" sequences Vk and Uk. The proposed algorithm uses Lucas sequence properties to improve the running time by about 20% over the algorithm published in [1].
openaire +1 more source
On arithmetic progressions in Lucas sequences
J. Integer Seq., 2017 In this paper, we consider arithmetic progressions contained in Lucas sequences of first and second kind. We prove that for almost all sequences, there are only finitely many and their number can be effectively bounded. We also show that there are only a few sequences which contain infinitely many and one can explicitly list both the sequences and the ...
Lajos Hajdu +2 more
openaire +4 more sources
On New Polynomial Sequences Constructed to Each Vertex in an n-Gon
Discrete Dynamics in Nature and Society, 2022 In this work, we bring to light the properties of newly formed polynomial sequences at each vertex of Pell polynomial sequences placed clockwise at each vertex in the n-gon. We compute the relation among the polynomials with such vertices.
Abdul Hamid Ganie +3 more
doaj +1 more source
A New Family of k-Quasi Morgan-Voyce Sequences
Journal of Advanced Engineering and ComputationIn this study, we define the kQuasi Morgan-Voyce and k-Quasi MorganVoyce-Lucas sequences, and some terms of these sequences are given. We introduce the closed-form formulas that give the terms of these sequences.
Hakan Akkuş, Engin Özkan
doaj +1 more source
Repdigits in k-Lucas sequences
Proceedings - Mathematical Sciences, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bravo, Jhon J., Luca, Florian
openaire +1 more source
On the discriminator of Lucas sequences [PDF]
Annales mathématiques du Québec, 2018 We consider the family of Lucas sequences uniquely determined by $U_{n+2}(k)=(4k+2)U_{n+1}(k) -U_n(k),$ with initial values $U_0(k)=0$ and $U_1(k)=1$ and $k\ge 1$ an arbitrary integer. For any integer $n\ge 1$ the discriminator function $\mathcal{D}_k(n)$ of $U_n(k)$ is defined as the smallest integer $m$ such that $U_0(k),U_1(k),\ldots,U_{n-1}(k)$ are
Faye, B. ; https://orcid.org/0000-0002-2299-5956 +2 more
openaire +4 more sources
Copper Lacus Sequence Spaces Associated With Operator Ideals and Their Geometric Properties
Journal of MathematicsIn this research, we introduce the regular Copper Lucas matrix operator, which is based on the Copper Lucas sequence. We investigate the sequence spaces c0Γ and cΓ, as well as lpΓ for 1≤p≤∞, all of which are linked to the newly defined regular Copper ...
Shiva Shah +3 more
doaj +1 more source
The Square Terms in Lucas Sequences
Journal of Number Theory, 1996 Let \(P\) and \(Q\) be relatively prime odd integers and define the sequences \(\{U_n\}\) and \(\{V_n\}\) by \(U_n = PU_{n - 1} - QU_{n - 2}\) with \(U_0 = 0\), \(U_1 = 1\) and \(V_n = PV_{n - 1} - QV_{n - 2}\) with \(V_0 = 2\), \(V_1 = P\). The main results of the paper are the following. (i) If \(V_n\) is a square, then \(n = 1,3\) or 5.
Ribenboim, Paulo, McDaniel, Wayne L.
openaire +1 more source
Copper ratio obtained by generalizing the Fibonacci sequence
AIP AdvancesIn this study, we define a new generalization of the Fibonacci sequence that gives the copper ratio, and we will call it the copper Fibonacci sequence. In addition, inspired by the copper Fibonacci definition, we also define copper Lucas sequences, and ...
Engin Özkan, Hakan Akkuş
doaj +1 more source