相关论文: On Concatenations of Two $ k $-Generalized Fibonac…

A Cullen number is a number of the form $m2^m+1$, where $m$ is a positive integer. In 2004, Luca and St\u anic\u a proved, among other things, that the largest Fibonacci number in the Cullen sequence is $F_4=3$. Actually, they searched for…

This contribution presents all possible solutions to the Diophantine equations $F_k=L_mL_n$ and $L_k=F_mF_n$. To be clear, Fibonacci numbers that are the product of two arbitrary Lucas numbers and Lucas numbers that are the product of two…

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}_{n=1}^{\infty}$. Lekkerkerker proved that the average number of summands for integers in $[F_n,…

We study new identities related to the sums of adjacent terms in the Pell sequence, defined by $P_{n} := 2P_{n-1}+P_{n-2}$ for $ n\geq 2$ and $P_{0}=0, P_{1}=1$, and generalize these identities for many similar sequences. We prove that the…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we solve all powers of two which are sums of four Fibonacci numbers with a few exceptions that we…

We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…

In this paper we establish some sophisticated congruences involving central binomial coefficients and Fibonacci numbers. For example, we show that if $p\not=2,5$ is a prime then $$\sum_{k=0}^{p-1}F_{2k}\binom{2k}{k}=(-1)^{[p/5]}(1-(p/5))…

Zeckendorf proved that every positive integer can be expressed as the sum of non-consecutive Fibonacci numbers. This theorem inspired a beautiful game, the Zeckendorf Game. Two players begin with $n \ 1$'s and take turns applying rules…

For $ k \geq 2 $, let $ A = (a_{1}, a_{2}, \ldots, a_{k}) $ be a $k$-tuple of positive integers with $\gcd(a_{1}, a_2, \ldots, a_k) = 1$. For a non-negative integer $s$, the generalized Frobenius number of $A$, denoted as $\mathtt{g}(A;s) =…

In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacci- and Lucas numbers.…

Let $F(z)$ be a $k$-regular series in $\mathbb{Z}[[z]]$ and $b$ be an integer with $b\ge2$. Bell, Bugeaud and Coons [BelBC] proved that $F(\frac{1}{b})$ is either rational or transcendental. In [Mi], we introduce a generalized $k$-regular…

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.

As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…

We prove that the difference between the $n$-th hyperfibonacci number of $r$-th generation and its two consecutive predecessors is the $n$-th regular $(r-1)$-topic number. Using this fact we provide an equivalent recursive definition of…

For integers $k \geq 2$, the $k$-generalized Lucas sequence $\{L_n^{(k)}\}_{n \geq 2-k}$ is defined by the recurrence relation \[ L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \quad \text{for } n \geq 2, \] with initial terms given by…

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…

We prove that the generalised Fibonacci group F(r,n) is infinite for (r,n) in {(7 + 5k,5), (8 + 5k,5)} where k is greater than or equal to 0. This together with previously known results yields a complete classification of the finite F(r,n),…

In this paper, generalized Pell graphs $\Pi _{n,k}$, $k\ge 2$, are introduced. The special case of $k=2$ are the Pell graphs $\Pi _{n}$ defined earlier by Munarini. Several metric, enumerative, and structural properties of these graphs are…

This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…

In this paper, we introduce the concept of $F$-perfect number, which is a positive integer $n$ such that $\sum_{d|n,d<n}d^2=3n$. We prove that all the $F$-perfect numbers are of the form $n=F_{2k-1}F_{2k+1}$, where both $F_{2k-1}$ and…