Related papers: Some Weighted Generalized Fibonacci Number Summati…
We extend a result of I. J. Good and prove more symmetry properties of sums involving generalized Fibonacci numbers
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…
Since the $\mathrm{Fibonacci}$ sequence has good properties, it's important in theory and applications, such as in combinatorics, cryptography, and so on. In this paper, for the generalized Fibonacci sequence…
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.
In this paper, we consider the generalized Fibonacci quaternion which is the Horadam quaternion sequence. Then we used the Binet's formula to show some properties of the Horadam quaternion. We get some generalized identities of the Horadam…
Iterating Newton's method symbolically for the general quadratic yields a rational function, the numerator and denominator of which are polynomials with highly composite coefficients.
The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined…
We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…
This paper introduces a variation on an identity by Bruckman and Good. Using this identity, we are able to derive various well-known sums involving reciprocals of Fibonacci and Lucas numbers, including the case when the indices form an…
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…
A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…
We show how infinite series of a certain type involving generalized harmonic numbers can be computed using a knowledge of symmetric functions and multiple zeta values. In particular, we prove and generalize some identities recently…
We discuss an interesting sequence defined recursively; namely, sequence A105774 from the On-Line Encyclopedia of Integer Sequences, and study some of its properties. Our main tools are Fibonacci representation, finite automata, and the…
We generalize a terminating summation formula to a unilateral nonterminating, and further, a bilateral summation formula by a property of analytic functions. The unilateral one is proved to be a $q$-analogue of a $_4F_3$-summation formula.…
A new summation method is introduced to convert a relatively wide family of infinite sums and local expansions into integrals. The integral representations yield global information such as analytic continuability, position of singularities,…
We develop a systematic and fully explicit approach to the evaluation of binomial sums involving reciprocals of binomial coefficients based on Beta integral techniques. Starting from a simple integral representation, we provide a derivation…
We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation $a(n) = \sum_{i=1}^p a(n-i+1 - a(n-i))$, where $p$ is prime. This combinatorial problem is less general than those given in [3]…
In this paper we use a formula for the $n$-th power of a $2\times2$ matrix $A$ (in terms of the entries in $A$) to derive various combinatorial identities. Three examples of our results follow. 1) We show that if $m$ and $n$ are positive…