相关论文: Convoluted convolved Fibonacci numbers
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
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…
A Filbert matrix is a matrix whose (i,j) entry is 1/F_(i+j-1), where F_n is the nth Fibonacci number. The inverse of the n by n Filbert matrix resembles the inverse of the n by n Hilbert matrix, and we prove that it shares the property of…
We offer several new summation identities involving harmonic numbers, odd harmonic numbers, and Fibonacci numbers. Our results are derived using three different approaches: partial summation, polynomial identities and binomial…
The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…
We study certain series with Catalan numbers and reciprocal Catalan numbers, respectively, and provide seemingly new closed form evaluations of these series with Fibonacci (Lucas) entries. In addition, we state some combinatorial sums that…
We introduce a family of Dirichlet series associated to real quadratic number fields that generalize the ordinary Fibonacci zeta function $\sum F(n)^{-s}$, where $F(n)$ denotes the $n$th Fibonacci number. We then give three different…
The regularized product of the Fibonacci numbers is evaluated.
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…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
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…
Let $I_n(x)=\prod_{i=1}^n \left( 1+x^{F_{i+1}}\right)$, where $F_{i+1}$ denotes a Fibonacci number. Let $v_r(n)$ denote the sum of the $r$th powers of the coefficients of $I_n(x)$. Our prototypical result is that $\sum_{n\geq 0} v_2(n)x^n=…
At the first, we revise the Kosinski definition of the sum of ordered fuzzy numbers. The associativity of revised sum is investigated here. In addition, we show that the multiple revised sum of finite sequence of trapezoidal ordered fuzzy…
We obtain explicit factored closed-form expressions for Fibonacci and Lucas sums of the form \mbox{$\sum_{k = 1}^n {F_{2rk}^3 }$} and \mbox{$\sum_{k = 1}^n {L_{2rk}^3 }$}, where $r$~and~$n$ are integers.
A positive integer $n$ is called a balancing number if there exists a positive integer $r$ such that $1 + 2 + \cdots + (n-1) = (n+1) + (n+2) + \cdots + (n+r)$. The corresponding value $r$ is known as the balancer of $n$. If $n$ is a…
The coefficient of x^{-1} of a formal Laurent series f(x) is called the formal residue of f(x). Many combinatorial numbers can be represented by the formal residues of hypergeometric terms. With these representations and the extended…
In recent years, some degenerate versions of quite a few special numbers and polynomials are introduced and investigated by means of various methods. The aim of this paper is to study some results on degenerate harmonic numbers, degenerate…
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…
The classical Frobenius-Schur indicators for finite groups are character sums defined for any representation and any integer m greater or equal to 2. In the familiar case m=2, the Frobenius-Schur indicator partitions the irreducible…
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))…