Related papers: Links Between Sums Over Paths in Bernoulli's Trian…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
We define two notions of partial sums of a Riordan array, corresponding respectively to the partial sums of the rows and the partial sums of the columns of the Riordan array in question. We characterize the matrices that arise from these…
In this paper, we find the closed sums of certain type of Fibonacci related convergent series. In particular, we generalize some results already obtained by Brousseau, Popov, Rabinowitz and others.
Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…
We derive some q-analogs of Euler-Cassini-type identities and of recurrence formulas for powers of Fibonacci polynomials.
In this paper, we consider infinite sums derived from the reciprocals of the generalized Fibonacci numbers. We obtain some new and interesting identities for the generalized Fibonacci numbers.
In this paper, we pose many challenging conjectures on congruences involving binomial coefficients and Ap\'ery-like numbers.
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…
In this paper, by presenting bi-periodic Lucas numbers as a binomial sum, we introduce the bi-periodic incomplete Lucas numbers. After that, by using the bi-periodic incomplete Lucas numbers, we derive the recurrence relation and the…
In this note, we propose simple summations for primes, which involve two finite nested sums and Bernoulli numbers. The summations can also be expressed in terms of Bernoulli polynomials.
For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…
We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians…
Ismail et al. (Constr. Approx. {\bf 15} (1999) 69--81) proved the positivity of some trigonometric polynomials with single binomial coefficients. In this paper, we prove some similar results by replacing the binomial coefficients with…
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…
In this paper, we find all the sums of three Fibonacci numbers which are close to a power of 2. This paper continues and extends the previous work of Hasanalizade \cite{Hasanalizade}.
The trinomial transform of a sequence is a generalization of the well-known binomial transform, replacing binomial coefficients with trinomial coefficients. We examine Pascal-like triangles under trinomial transform, focusing on the ternary…
In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the…
Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…
We investigate a combinatorial sum that can be interpreted as the moments of a random variate, measuring the absolute distance to the origin in a symmetric Bernoulli random walk. These sums can be characterized by polynomials related to the…