English
Related papers

Related papers: New Identities for Padovan Numbers

200 papers

In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan and Fibonacci sequence. The proof of our main theorem uses…

Number Theory · Mathematics 2022-07-28 Pagdame Tiebekabe , Serge Adonsou

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

Combinatorics · Mathematics 2023-09-18 Sejin Park , Etienne Phillips , Peikai Qi , Ilir Ziba , Zhan Zhan

Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…

Combinatorics · Mathematics 2026-04-28 Zixian Yang , Jianchao Bai

The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…

Data Structures and Algorithms · Computer Science 2018-04-16 Ali Dasdan

Two new generalized Fibonacci number summation identities are stated and proved, and two other new generalized Fibonacci number summation identities are derived from these, of which two special cases are already known in literature.

Number Theory · Mathematics 2018-08-30 M. J. Kronenburg

Let $a, b\in \mathbb{N}$ be relatively prime. Previous work showed that exactly one of the two equations $ax + by = (a-1)(b-1)/2$ and $ax + by + 1 = (a-1)(b-1)/2$ has a nonnegative, integral solution; furthermore, the solution is unique.…

A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…

Number Theory · Mathematics 2020-08-25 Eric F. Bravo , Jhon J. Bravo , Carlos A. Gómez

It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…

Combinatorics · Mathematics 2007-05-23 E. Barcucci , A. Bernini , M. Poneti

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

We study formulas expressing Fibonacci numbers as sums over compositions using free submonoids of the free monoid of compositions with parts 1 and 2.

Combinatorics · Mathematics 2013-03-20 Ira M. Gessel , Ji Li

In the last 30 years, the mathematical theory of aperiodic order has developed enormously. Many new tilings and properties have been discovered, few of which are covered or anticipated by the early papers and books. Here, we start from the…

Metric Geometry · Mathematics 2025-01-29 Michael Baake , Franz Gähler , Jan Mazáč

This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…

Number Theory · Mathematics 2014-03-20 Brandon Avila , Tanya Khovanova

The sequence of partial sums of Fibonacci numbers, beginning with $2$, $4$, $7$, $12$, $20$, $33,\dots$, has several combinatorial interpretations (OEIS A000071). For instance, the $n$-th term in this sequence is the number of length-$n$…

Combinatorics · Mathematics 2025-03-17 Erik Bates , Blan Morrison , Mason Rogers , Arianna Serafini , Anav Sood

We give a survey of some known and some new results about factors of different sorts of $q-$Fibonacci numbers.

Number Theory · Mathematics 2016-05-03 Johann Cigler

We classify all solution triples with Fibonacci components to the equation $a^2+b^2+c^2=3abc+m,$ for positive $m$. We show that for $m=2$ they are precisely $(1,F(b),F(b+2))$, with even $b$; for $m=21$, there exist exactly two Fibonacci…

Number Theory · Mathematics 2025-01-30 D. Alfaya , L. A. Calvo , A. Martínez de Guinea , J. Rodrigo , A. Srinivasan

We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the…

Number Theory · Mathematics 2022-02-28 Greg Dresden

The convolved Fibonacci numbers F_j^(r) are defined by (1-z-z^2)^{-r}=\sum_{j>=0}F_{j+1}^(r)z^j. In this note some related numbers that can be expressed in terms of convolved Fibonacci numbers are considered. These numbers appear in the…

Combinatorics · Mathematics 2007-05-23 Pieter Moree

Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.

Number Theory · Mathematics 2019-07-19 Helmut Prodinger

Let $\left(P_{n}\right)_{n\geq0}$ be the sequence of bi-periodic Padovan numbers and let $\left(M_{p_{n}}\right)_{n\geq0}$ be the sequence of bi-periodic Padovan matrices. In this article we study when these matrices are diagonalizable and…

Combinatorics · Mathematics 2026-03-31 Diana Savin

If L, respectively R are matrices with entries binom{i-1,j-1}, respectively binom{i-1,n-j}, it is known that L^2 = I (mod 2), respectively R^3 = I (mod 2), where I is the identity matrix of dimension n > 1 (see P10735-May 1999 issue of the…

Combinatorics · Mathematics 2007-05-23 Rhodes Peele , Pantelimon Stanica