Related papers: Simson Identity of Generalized m-step Fibonacci Nu…

In a recent insightful article, Helmut Prodinger uses sophisticated complex analysis, with residues, to derive convolution identities for Fibonacci, Tribonacci, and k-bonacci numbers. Here we use a naive, "experimental mathematics" (yet…

In this paper, we show that the classical Cassini and Catalan identities for Fibonacci numbers arise naturally from a single quadratic theta-function identity of Ramanujan. Expanding the identity…

We prove certain Menon-type identities associated with the subsets of the set $\{1,2,\ldots,n\}$ and related to the functions $f$, $f_k$, $\Phi$ and $\Phi_k$, defined and investigated by Nathanson (2007).

Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. For all integers $a$ and $b \geq 1$ with $\gcd(a, b) = 1$, let $[a^{-1} \!\bmod b]$ be the multiplicative inverse of $a$ modulo $b$, which we pick in the usual set of…

We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…

The sequence $F_{dn+h}$ and its convolutions have (for $h=0$) been studied in a recent paper at the arxiv [arXiv:2603.08636]. The instance with general $h$ is more involved and uses Chebyshev polynomials.

Horadam introduced a new generalized sequence of numbers, describing its key features and the special sub-sequences that are obtained depending on the choices of initial parameters. This sequence and its sub-sequences are known as the…

Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…

In this paper, we obtain a generalization of an identity due to Carlitz on Bernoulli polynomials. Then we use this generalized formula to derive two symmetric identities which reduce to some known identities on Bernoulli polynomials and…

For each positive integer $n$, the Fibonacci-sum graph $G_n$ on vertices $1,2,\ldots,n$ is defined by two vertices forming an edge if and only if they sum to a Fibonacci number. It is known that each $G_n$ is bipartite, and all Hamiltonian…

The Fibonacci sequence has been generalized in many ways. One of them is defined by the relation $t_n=at_{n-1}+t_{n-2}$ if $n$ is even, $t_n=bt_{n-1}+t_{n-2}$ if $n$ is odd, with initial values $t_0=0$ and $t_1=1$, where $a$ and $b$ are…

In this paper, we establish an identity for Bernoulli's generalized polynomials. We deduce generalizations for many relations involving classical Bernoulli numbers or polynomials. In particular, we generalize a recent Gessel identity.

We derive some Fibonacci and Lucas identities which contain inverse binomial coefficients. Extension of the results to the general Horadam sequence is possible, in some cases.

This paper addresses A Pillai-Catalan-type problem assosiated with Fibonacci numbers. Let $F_{n}$ be the Fibonacci numbers defined by the recurrence relation $F_{1}=1$, $F_{2}=1$ and $F_{n}=F_{n-1}+F_{n-2}$ for all $n\geq 3$. We will find…

Let $p$ be a prime number. A chain $\{p,2p+1,4p+3,\cdots,(p+1)2^{l(p)-1}-1\}$ is called the Cunningham chain generated by $p$ if all elements are prime number and $(p+1)2^{l(p)}-1$ is composite. Then $l(p)$ is called the length of the…

This paper proposes a computational method for obtaining the length of the cycle that arises from the Fibonacci series taken mod m (some number) and mod p (some prime number).

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robustness and compression capability. Asymptotically, these codes provide better compression efficiency as the order of the underlying Fibonacci…

In 2016, Edgar and, independently of him, Bhatnagar sta\-ted a nice polynomial identity that connects Fibonacci and Lucas numbers. Shortly after their publications, this identity has been generalized in two different ways: Dafnis, Phillipou…

Various families of octonion number sequences (such as Fibonacci octonion, Pell octonion and Jacobsthal octonion) have been established by a number of authors in many different ways. In addition, formulas and identities involving these…