English
Related papers

Related papers: Period patterns, entry points, and orders in the L…

200 papers

We describe how to compute the intersection of two Lucas sequences of the forms $\{U_n(P,\pm 1) \}_{n=0}^{\infty}$ or $\{V_n(P,\pm 1) \}_{n=0}^{\infty}$ with $P\in\mathbb{Z}$ that includes sequences of Fibonacci, Pell, Lucas, and Lucas-Pell…

Number Theory · Mathematics 2011-06-14 Max A. Alekseyev

We study Gibonacci sequences mod $m$, giving special attention to the Lucas numbers. It is known which $m$ have the property that the Fibonacci sequence contains all residues mod $m$. When $m$ has this property, we say that the Fibonacci…

Number Theory · Mathematics 2014-02-05 Jeremiah T. Southwick

For the Lucas sequence $\{U_{k}(P,Q)\}$ we discuss the identities such as the well-known Fibonacci identities. We also propose a method for obtaining identities involving recurrence sequences. With the help of which we find an interpolating…

Number Theory · Mathematics 2018-05-18 Dmitry I. Khomovsky

In the \textit{Fibonacci Quarterly} in 1964, C.~R.~Wall gave the following weighted sum of generalized Fibonacci numbers: $\sum_{i=1}^n i G_i = n G_{n+2} - G_{n+3} + G_3$, where $\left(G_n\right)_{n \geq 0}$ is defined by the recurrence…

Number Theory · Mathematics 2025-11-24 aBa Mbirika

We present here some new identities for generalizations of Fibonacci and Lucas numbers by combinatorially interpreting these numbers in terms of numbers of certain tilings of a $1 \times m$ board. As a consequence, some new interesting…

Combinatorics · Mathematics 2016-09-06 Robson da Silva

In this paper, we extend the $p$-adic valuations originally obtained by Carmichael for the sequences obtained by applying M\"obius inversion to Lucas sequences to $p$-adic congruences, from which we immediately derive corresponding…

Number Theory · Mathematics 2026-01-09 Tyler Ross , Zhongyan Shen , Tianxin Cai

Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…

Number Theory · Mathematics 2021-08-10 Carlo Sanna

Wall published a paper in 1960 on the Fibonacci sequence where he derived many results concerning the period and prime power divisibility modulo m. His periodicity results have been generalized to second order linear recurrences. Here we…

Combinatorics · Mathematics 2015-10-01 Soumyabrata Pal , Shankar M. Venkatesan

In this work, we made a generalization that includes all bicomplex Fibonacci-like numbers such as; Fibonacci, Lucas, Pell, etc.. We named this generalization as bicomplex Horadam numbers. For bicomplex Fibonacci and Lucas numbers we gave…

Rings and Algebras · Mathematics 2018-12-27 Serpil Halici , Adnan Karataş

The Lucas sequences are integers defined by a homogeneous recurrence relation. They include the well-known Fibonacci numbers, which appear abundantly in nature. The complementary Lucas numbers, defined by the same recurrence relation, are…

Quantum Physics · Physics 2026-04-13 Li Ge

We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…

Combinatorics · Mathematics 2007-05-23 Mario Catalani

We introduce a new four-parameters sequence that simultaneously generalizes some well-known integer sequences, including Fibonacci, Padovan, Jacobsthatl, Pell, and Lucas numbers. Combinatorial interpretations are discussed and many…

Number Theory · Mathematics 2017-05-16 Robson da Silva , Kelvin S. de Oliveira , Almir C. G. Neto

In this paper, we discuss about some results on average of Fibonacci and Lucas sequences that may be found in the OEIS code A111035.

Combinatorics · Mathematics 2020-02-03 Daniel Yaqubi , Amirali Fatehizadeh

In this paper, we consider a generalization of Horadam sequence fwng which is defined by the recurrence relation wn = x(n)wn-1+ cwn-2; where x(n) = a if n is even, x(n) = b if n is odd with arbitrary initial conditions w0;w1 and nonzero…

Number Theory · Mathematics 2019-10-10 Elif Tan , Ho-hon Leung

In 1878 \'E. Lucas proved a remarkable result which provides a simple way to compute the binomial coefficient ${n\choose m}$ modulo a prime $p$ in terms of the binomial coefficients of the base-$p$ digits of $n$ and $m$: {\it If $p$ is a…

Number Theory · Mathematics 2014-09-15 Romeo Meštrović

Classical studies of the Fibonacci sequence focus on its periodicity modulo $m$ (the Pisano periods) with canonical initialization. We investigate instead the complete periodic structure arising from all $m^2$ possible initializations in…

Number Theory · Mathematics 2026-04-10 Marc T. Pudelko

We derive several identities for arbitrary homogeneous second order recurrence sequences with constant coefficients. The results are then applied to present a unified study of six well known integer sequences, namely the Fibonacci sequence,…

General Mathematics · Mathematics 2018-06-07 Kunle Adegoke

We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…

Number Theory · Mathematics 2015-03-19 Jerico B. Bacani , Julius Fergy T. Rabago

In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence…

Number Theory · Mathematics 2015-06-11 Alexandre Laugier , Manjil P. Saikia

Sury's 2014 proof of an identity for Fibonacci and Lucas numbers (Identity 236 of Benjamin and Quinn's 2003 book: {\em Proofs that count: The art of combinatorial proof}) has excited a lot of comment. We give an alternate, telescoping,…

Combinatorics · Mathematics 2016-08-09 Gaurav Bhatnagar
‹ Prev 1 2 3 10 Next ›