English
Related papers

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

200 papers

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

Number Theory · Mathematics 2016-11-29 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

We say that an arithmetical function $S:\mathbb{N}\rightarrow\mathbb{Z}$ has Lucas property if for any prime $p$, \begin{equation*} S(n)\equiv S(n_{0})S(n_{1})\ldots S(n_{r})\pmod p, \end{equation*} where $n=\sum_{i=0}^{r}n_{i}p^{i}$, with…

Number Theory · Mathematics 2016-12-22 Hao Zhong , Tianxin Cai

In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also…

Number Theory · Mathematics 2020-09-17 Santiago Alzate , Oscar Correa , Rigoberto Flórez

This paper first discusses the size and orientation of hat supertiles. Fibonacci and Lucas sequences, as well as a third integer sequence linearly related to the Lucas sequence are involved. The result is then generalized to any aperiodic…

Combinatorics · Mathematics 2024-05-01 Shiying Dong

The generalized Fibonacci recurrence $g_n=g_{n-k}+g_{n-m}$ was recently used to demonstrate the theoretically optimal nature of limited senescence in morphologically symmetrically dividing bacteria. Here, we study this recurrence from a…

Combinatorics · Mathematics 2020-01-01 Natasha Blitvić , Vicente I. Fernandez

For Lucas sequences of the first kind (u_n) and second kind (v_n) defined as usual for positive n by u_n=(a^n-b^n)/(a-b), v_n=a^n+b^n, where a and b are either integers or conjugate quadratic integers, we describe the set of indices n for…

Number Theory · Mathematics 2009-08-27 Chris Smyth

The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…

Number Theory · Mathematics 2017-05-31 Kyunghwan Song , Youngwoo Kwon

In this paper, we consider the new family of recurrence sequences of $(q,k)$-generalized Fibonacci numbers. These sequences naturally extend the well-known sequences of $k$-generalized Fibonacci numbers and generalized $k$-order Pell…

Number Theory · Mathematics 2022-11-17 Gérsica Freitas , Alessandra Kreutz , Jean Lelis , Elaine Silva

This paper is concerned with developing some new identities of generalized Fibonacci numbers and generalized Pell numbers. A new class of generalized numbers is introduced for this purpose. The two well-known identities of Sury and Marques…

Number Theory · Mathematics 2015-11-25 W. M. Abd-Elhameed , N. A. Zeyada

In this study, we introduce a new classes of quaternion numbers. We show that this new classes quaternion numbers include all of quaternion numbers such as Fibonacci, Lucas, Pell, Jacobsthal, Pell-Lucas, Jacobsthal-Lucas quaternions have…

Rings and Algebras · Mathematics 2016-11-24 Serpil Halıcı

In this article, we present a trick around Fibonacci numbers which can be found in several magic books. It consists in computing quickly the sum of the successive terms of a Fibonacci-like sequence. We give explanations and extensions of…

History and Overview · Mathematics 2015-01-27 Aimé Lachal

Recurrence plots provide a graphical representation of the recurrent patterns in a timeseries, the quantification of which is a relatively new field. Here we derive analytical expressions which relate the values of key statistics, notably…

Data Analysis, Statistics and Probability · Physics 2007-05-23 T. K. March , S. C. Chapman , R. O. Dendy

We establish some new combinatorial identities involving Euler polynomials and balancing (Lucas-balancing) polynomials. The derivations use elementary techniques and are based on functional equations for the respective generating functions.…

Number Theory · Mathematics 2020-09-22 Robert Frontczak , Taras Goy

The following work shows new connections between the constants $\pi$ and $e$ with Pascal's triangle and the Lucas triangle, established via Fibonacci polynomials and similar means. Furthermore, relations between the two famous constants and…

Combinatorics · Mathematics 2023-02-20 Mauricio Guevara V.

Polynomially-recursive sequences generally have a periodic behavior mod $m$. In this paper, we analyze the period mod $m$ of a second order polynomially-recursive sequence. The problem originally comes from an enumeration of avoiding…

Number Theory · Mathematics 2019-03-07 Cyril Banderier , Florian Luca

The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…

Combinatorics · Mathematics 2020-10-01 Curtis Bennett , Juan Carrillo , John Machacek , Bruce E. Sagan

In this paper, using a generating function approach, we derive several new convolution sum identities involving Fibonacci m-step numbers. As special instances of the results derived herein, we will get many new and known results involving…

General Mathematics · Mathematics 2024-04-01 Robert Frontczak , Karol Gryszka

In this paper, new families of generalized Fibonacci and Lucas numbers are introduced. In addition, we present the recurrence relations and the generating functions of the new families for $k=2$.

Combinatorics · Mathematics 2017-10-03 Gamaliel Cerda-Morales

Following Bridgeman, we demonstrate several families of infinite dilogarithm identities associated with Fibonacci numbers, Lucas numbers, convergents of continued fractions of even periods, and terms arising from various recurrence…

Geometric Topology · Mathematics 2020-06-09 Pradthana Jaipong , Mong Lung Lang , Ser Peow Tan , Ming Hong Tee

The Fibonacci sequence defined by $F_0=0$, $F_1=1$, and $F_n=F_{n-1}+F_{n-2}$ has a shortest period length of $4\cdot 3^{k-1}$ modulo $3^k$ for every $k\in\mathbb{N}$. In 2011, Bundschuh and Bundschuh \cite{bundschuh3} gave the frequencies…

Number Theory · Mathematics 2025-11-04 J. C. Saunders , R. Nicholas Stephens