English
Related papers

Related papers: One Parameter Generalizations of the Fibonacci and…

200 papers

An overlooked formula of E. Lucas for the generalized Bernoulli numbers is proved using generating functions. This is then used to provide a new proof and a new form of a sum involving classical Bernoulli numbers studied by K. Dilcher. The…

Number Theory · Mathematics 2014-02-14 V. H. Moll , C. Vignat

Given that $a,b\in\mathbb N$, $c_0,c_1\in\mathbb Z$, $(c_0,c_1)\neq (0,0)$, and a generalized Fibonacci sequence $(s_n)_{n\geq 0}$ where $s_0 = c_0$, $s_1 = c_1$, and $s_{n+1}=as_{n}+bs_{n-1}$ for all positive integers $n$. In this paper,…

Number Theory · Mathematics 2025-05-12 Ivan Hadinata

Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. Once this has been shown, it's natural to ask how many summands are needed. Using a continued fraction approach,…

Number Theory · Mathematics 2010-08-20 Murat Kologlu , Gene Kopp , Steven J. Miller , Yinghui Wang

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…

Number Theory · Mathematics 2023-06-16 Carlo Sanna

We introduce generalized hypergeometric Bernoulli numbers for Dirichlet characters. We study their properties, including relations, expressions and determinants. At the end in Appendix we derive first few expressions of these numbers.

Number Theory · Mathematics 2021-04-06 Kalyan Chakraborty , Takao Komatsu

By investigating a recurrence relation about functions, we first give alternative proofs of various identities on Fibonacci numbers and Lucas numbers, and then, make certain well known identities visible via certain trivalent graph…

Number Theory · Mathematics 2013-04-04 Cheng Lien Lang , Mong Lung Lang

We consider Hankel determinants of the sequence of Catalan numbers modulo 2 (interpreted as integers 0 and 1) and more generally Hankel determinants where the sum over all permutations reduces to a single signed permutation.

Combinatorics · Mathematics 2018-03-29 Johann Cigler

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

Number Theory · Mathematics 2025-01-08 Roberto Alvarenga , Ana Paula Chaves , Maria Eduarda Ramos , Matheus Silva , Marcos Sosa

The goal of this paper is twofold: (1) extend theory on certain statistics in the Fibonacci and Lucas sequences modulo $m$ to the Lucas sequences $U := \left(U_n(p,q)\right)_{n \geq 0}$ and $V := \left(V_n(p,q)\right)_{n \geq 0}$, and (2)…

Number Theory · Mathematics 2024-12-30 Morgan Fiebig , aBa Mbirika , Jürgen Spilker

The Concepts of poly-Bernoulli numbers $B_n^{(k)}$, poly-Bernoulli polynomials $B_n^{k}{(t)}$ and the generalized poly-bernoulli numbers $B_{n}^{(k)}(a,b)$ are generalized to $B_{n}^{(k)}(t,a,b,c)$ which is called the generalized…

Number Theory · Mathematics 2012-12-18 Hassan Jolany , M. R. Darafsheh , R. Eizadi Alikelaye

In this paper, we give some determinantal and permanental representations of generalized bivariate Fibonacci p-polynomials by using various Hessenberg matrices. The results that we obtained are important since generalized bivariate…

Number Theory · Mathematics 2011-11-18 Kenan Kaygisiz , Adem Sahin

This paper builds on the research initiated by Boyadzhiev, but introduces generalized harmonic numbers, \[ H_n(\alpha)= \sum_{k=1}^n \frac{\alpha^{k}}{k}, \] which enable the derivation of new identities as well as the reformulation of…

General Mathematics · Mathematics 2025-12-23 Roberto Sanchez Peregrino

In this study, we define a new type of Fibonacci and Lucas num- bers which are called bicomplex Fibonacci and bicomplex Lucas numbers. We obtain the well-known properties e.g. Docagnes, Cassini, Catalan for these new types. We also give the…

Number Theory · Mathematics 2015-08-18 Semra Kaya Nurkan , İlkay Arslan Güven

In this paper, we deal with Diophantine equations $N = {F_k}^3 + {F_\ell }^3 = {F_m}^3 + {F_n}^3$ and $M = {L_k}^3 + {L_\ell }^3 = {L_m}^3 + {L_n}^3$. In other words, we discover the Fibonacci and Lucas numbers that are also Hardy-Ramanujan…

Number Theory · Mathematics 2024-01-31 Ahmet Daşdemir

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

We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…

Combinatorics · Mathematics 2010-03-05 Milan Janjic

The Hankel determinants $\left(\frac{r}{2(i+j)+r}\binom{2(i+j)+r}{i+j}\right)_{0\leq i,j \leq n-1}$ of the convolution powers of Catalan numbers were considered by Cigler and by Cigler and Krattenthaler. We evaluate these determinants for…

Combinatorics · Mathematics 2018-11-14 Ying Wang , Guoce Xin

The aim of this paper is to give linear independence results for the values of certain series. As an application, we derive arithmetical properties of the sums of reciprocals of Fibonacci and Lucas numbers associated with certain coprime…

Number Theory · Mathematics 2019-08-21 Daniel Duverney , Yuta Suzuki , Yohei Tachiya

For an integer \( k \geq 2 \), the sequence of \( k \)-generalized Lucas numbers is defined by the recurrence relation \( L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \) for all \( n \geq 2 \), with initial conditions \( L_0^{(k)} = 2…

Number Theory · Mathematics 2025-09-30 Alex Behakanira Tumwesigye , Mahadi Ddamulira , Prosper Kaggwa

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…

Combinatorics · Mathematics 2024-07-08 Yahia Djemmada , Abdelghani Mehdaoui , László Németh , László Szalay
‹ Prev 1 4 5 6 7 8 10 Next ›