中文
相关论文

相关论文: Convoluted convolved Fibonacci numbers

200 篇论文

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…

综合数学 · 数学 2024-04-01 Robert Frontczak , Karol Gryszka

In part 1 of this paper some linear weighted generalized Fibonacci number summation identities were derived using the fact that the Fibonacci number is the residue of a rational function. In this part, using the same method, some quadratic…

数论 · 数学 2021-07-14 M. J. Kronenburg

In this paper we compute the Frobenius number of certain {\em Fibonacci numerical semigroups}, that is, numerical semigroups generated by a set of Fibonacci numbers, in terms of Fibonacci numbers.

组合数学 · 数学 2007-05-23 J. M. Marin , J. Ramirez Alfonsin , M. P. Revuelta

We present a lovely connection between the Fibonacci numbers and the sums of inverses of $(0,1)-$ triangular matrices, namely, a number $S$ is the sum of the entries of the inverse of an $n \times n$ $(n \geq 3)$ $(0,1)-$ triangular matrix…

历史与综述 · 数学 2013-06-13 Miriam Farber , Abraham Berman

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.

综合数学 · 数学 2026-03-18 Helmut Prodinger

Let $(F_n)_{n\ge 1}$ be the Fibonacci sequence. Define $P(F_n): = (\sum_{i=1}^n F_i)_{n\ge 1}$; that is, the function $P$ gives the sequence of partial sums of $(F_n)$. In this paper, we first give an identity involving $P^k(F_n)$, which is…

组合数学 · 数学 2021-06-08 Hung Viet Chu

In this paper, we introduce the notion of fuzzy soft numbers. Here defined fuzzy soft number and four arithmetic operations $ \tilde{+}, \tilde{-}, \tilde{\times}, \tilde{\div} $ and related properties. Also introduce Hausdorff distance,…

综合数学 · 数学 2021-12-28 Manash Jyoti Borah , Bipan Hazarika

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

综合数学 · 数学 2019-01-09 Kunle Adegoke , Tokunbo Omiyinka

Let $\alpha = (1+\sqrt{5})/2$ and define the lower and upper Wythoff sequences by $a_i = \lfloor i \alpha \rfloor$, $b_i = \lfloor i \alpha^2 \rfloor$ for $i \geq 1$. In a recent interesting paper, Kawsumarng et al. proved a number of…

组合数学 · 数学 2020-06-09 Jeffrey Shallit

We show that for the classical Fibonacci sequence (Fn) and the Lucas sequence (Ln) the following identity holds for every integer n >= 2: (n-1)Fn equals the sum from k=1 to n-1 of Lk multiplied by F(n-k). Equivalently, this gives a…

数论 · 数学 2025-09-03 Tapan Suthar

In a previous paper we have presented a partition formula for the even-index Fibonacci numbers using the preprojective representations of the 3-Kronecker quiver and its universal cover, the 3-regular star. Now we deal in a similar way with…

表示论 · 数学 2011-07-13 Philipp Fahr , Claus Michael Ringel

In this study, the new algebraic properties related to bivariate Fibonacci polynomials has been given. We present the partial derivatives of these polynomials in the form of convolution of bivariate Fibonacci polynomials. Also, we define a…

数论 · 数学 2018-09-27 Tuba Çakmak , Erdal Karaduman

Let $(F_n)_{n\geq 0}$ and $(L_n)_{n\geq 0}$ be the Fibonacci and Lucas sequences, respectively. In this paper we determine all Fibonacci numbers which are mixed concatenations of a Fibonacci and a Lucas numbers. By mixed concatenations of $…

数论 · 数学 2022-06-29 Alaa Altassan , Murat Alan

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by the recurrence $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several generalizations of this sequence and also several interesting identities. In this…

数论 · 数学 2019-03-19 Carlos Alirio Rico Acevedo , Ana Paula Chaves

We give an explicit description of the coefficients of the formal power series (1-x)(1-x^2)(1-x^3)(1-x^5)(1-x^8)(1-x^13)... In particular, we show that all the coefficients are equal to -1, 0 or 1.

组合数学 · 数学 2007-05-23 Federico Ardila M

In this paper we study the sum $$\sum_{j_1+j_2+...+j_d=n}\prod_{i=1}^d F_{k\cdot j_i},$$ where $d\geq2$ and $k\geq1$.

组合数学 · 数学 2007-05-23 Toufik Mansour

In this note we investigate the solutions of certain meta-Fibonacci recurrences of the form $f(n)=f(n-f(n-1))+f(n-2)$ for various sets of initial conditions. In the case when $f(n)=1$ for $n\leq 1$, we prove that the resulting integer…

数论 · 数学 2022-04-11 Bartosz Sobolewski , Maciej Ulas

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…

数据结构与算法 · 计算机科学 2018-04-16 Ali Dasdan

We study certain cases of convoluted Fourier coefficients of $GL_n$-automorphic functions. We establish identities that express them in terms of Fourier coefficients related to unipotent orbits. The most general case that is studied is…

数论 · 数学 2015-12-01 Eleftherios Tsiokos

In this paper we consider particular generalized compositions of a natural number with a given number of parts. Its number is a weighted polynomial coefficient. The number of all generalized compositions of a natural number is a weighted…

组合数学 · 数学 2010-09-17 Milan Janjic