中文
相关论文

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

200 篇论文

We derive several identities for arbitrary homogeneous second order recurrence sequences with constant coefficients. The results are then applied to present a unified study of six well known integer sequences, namely the Fibonacci sequence,…

综合数学 · 数学 2018-06-07 Kunle Adegoke

For the Fibonacci numbers $F_n$, we have the self-convolution formula $5 \sum_{i=0}^n F_i F_{n-i} = (2n)F_{n+1} - (n+1)F_n$. We find the corresponding self-convolution formula for the Narayana numbers $R_n$ which satisfy $R_n = R_{n-1} +…

组合数学 · 数学 2026-05-22 Greg Dresden , Yuechen Xiao , Guanzhang Zhou

The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive 1s. We study a one parameter generalization, p-th order Fibonacci cubes $\Gamma^{(p)}_n$, which are subgraphs of $Q_n$ induced by…

组合数学 · 数学 2025-07-23 Michel Mollard

A number $s$ is the sum of the entries of the inverse of an $n \times n, (n \geq 3)$ upper triangular matrix with entries from the set $\{0, 1\}$ if and only if $s$ is an integer lying between $2-F_{n-1}$ and $2+F_{n-1}$, where $F_n$ is the…

组合数学 · 数学 2025-03-24 Manami Chatterjee , K. C. Sivakumar

We establish several recurrence relations and an explicit formula for V(n), the number of factorizations of the length-n prefix of the Fibonacci word into a (not necessarily strictly) decreasing sequence of standard Fibonacci words. In…

组合数学 · 数学 2019-01-08 Pierre Bonardo , Anna E. Frid , Jeffrey Shallit

In this note, we investigate some properties of the integer sequence of general term $a_n := \sum_{k = 0}^{n - 1} k! (n - k - 1)!$ ($\forall n \geq 1$) to derive a new identity of the Genocchi numbers $G_n$ ($n \in \mathbb{N}$), which…

数论 · 数学 2022-04-28 Bakir Farhi

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$…

组合数学 · 数学 2025-03-17 Erik Bates , Blan Morrison , Mason Rogers , Arianna Serafini , Anav Sood

We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…

组合数学 · 数学 2016-08-02 Aram Tangboonduangjit , Thotsaporn Thanatipanonda

We define the convolved h(x)-Fibonacci polynomials as an extension of the classical convolved Fibonacci numbers. Then we give some combinatorial formulas involving the h(x)-Fibonacci and h(x)-Lucas polynomials. Moreover we obtain the…

数论 · 数学 2013-08-20 José L. Ramírez

We opt to study the convergence of maximal real roots of certain Fibonacci-type polynomials given by $G_n=x^kG_{n-1}+G_{n-2}$. The special cases $k=1$ and $k=2$ are found in [4] and [7], respectively.

数论 · 数学 2008-12-16 Tewodros Amdeberhan

We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…

数论 · 数学 2022-11-29 Joshua M. Siktar

The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. Since $\mathbb{F}$ is uniformly recurrent, each factor $\omega$ appears infinite many times in the sequence which is arranged as…

动力系统 · 数学 2016-04-19 Huang Yuke , Wen Zhiying

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…

数论 · 数学 2014-03-20 Brandon Avila , Tanya Khovanova

Let $k\ge 2$ and $\{L_n^{(k)}\}_{n\geq 2-k}$ be the sequence of $k$-generalized Lucas numbers whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we show that this…

数论 · 数学 2025-04-04 Herbert Batte , Florian Luca

In a recent work, the combinatorial interpretation of the polynomial alpha(n;k1,k2,...,kn) counting the number of Monotone Triangles with bottom row k1 < k2 < ... < kn was extended to weakly decreasing sequences k1 >= k2 >= ... >= kn. In…

组合数学 · 数学 2012-07-19 Lukas Riegler

In this paper, we prove identities for members of the k-generalized Fibonacci sequence with negative indices and we apply these identities to deduce an exact formula for its zero-multiplicity.

数论 · 数学 2022-11-02 J. García , C. A. Gómez , F. Luca

Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$-generalized Lucas numbers for some fixed integer $k\ge 2$, whose first $k$ terms are $0,\;\ldots\;,\;0,\;2,\;1$ and each term afterward is the sum of the preceding $k$ terms. In this…

数论 · 数学 2023-11-27 Herbert Batte , Mahadi Ddamulira , Juma Kasozi , Florian Luca

We present a quite curious generalization of multi-step Fibonacci numbers. For any positive rational $q$, we enumerate binary words of length $n$ whose maximal factors of the form $0^a1^b$ satisfy $a = 0$ or $aq > b$. When $q$ is an integer…

组合数学 · 数学 2022-07-18 Sergey Kirgizov

Let $F_k$ be the $k$th Fibonacci number. Let $(G_k)_{k\in\mathbb Z}$ be any sequence obeying the recurrence relation of the Fibonacci numbers. We employ the Gerin-Ces\`aro identity and an identity of Brousseau to evaluate the following…

组合数学 · 数学 2023-10-10 Kunle Adegoke

The purpose of this paper is twofold. First, the definition of new statistical convergence with Fibonacci sequence is given and some fundamental properties of statistical convergence are examined. Second, approximation theory worked as a…

泛函分析 · 数学 2016-07-11 Murat Kirisci , Ali Karaisa