Related papers: Some Explicit Formulas for Sums Involving the Bino…

Roman logarithmic binomial formula analogue has been found . It is presented here also for the case of fibonomial coefficients which recently have been given a combinatorial interpretation by the present author.

In this paper we derive some new identities involving the Fibonacci and Lucas polynomials and the Chebyshev polynomials of the first and the second kind. Our starting point is a finite trigonometric sum which equals the resolvent kernel on…

Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…

We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…

A recent paper of A. Sofo proves some results about sums of products of quadratic alternating harmonic numbers and reciprocal binomial coefficients. In this paper, we extend his result to cubic alternating harmonic number sums and develop…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

We present several types of ordinary generating functions involving central binomial coefficients, harmonic numbers, and odd harmonic numbers. Our results complement those of Boyadzhiev from 2012 and Chen from 2016. Based on these…

In this paper, we find all sums of two Fibonacci numbers which are close to a power of 2. As a corollary, we also determine all Lucas numbers close to a power of 2. The main tools used in this work are lower bounds for linear forms in…

We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in particular, a Faulhaber-like formula for sums of the form $1^m (n-1)^m + 2^m (n-2)^m + \cdots + (n-1)^m 1^m$ for positive integers $m$ and…

A simple matrix formulation of the Fibonacci, Lucas, Chebyshev, and Dixon polynomials polynomials is presented. It utilizes the powers and the symmetric tensor powers of a certain matrix.

In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…

Up to our knowledge -since about 126 years we were lacking of classical type combinatorial interpretation of Fibonomial coefficients as it was Lukas \cite{1} - to our knowledge -who was the first who had defined Finonomial coefficients and…

We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…

By combining the telescoping method with an algebraic relation, four classes of binomial moments are examined. Several explicit summation formulae are established.

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…

A new class of alternating convolutions concerning binomial coefficients and Catalan numbers are evaluated in closed forms.

We establish necessary and sufficient conditions for a polynomial to be divisible by a cyclotomic polynomials and derive new formulas involving Ramanujan sums as an application of our results. Additionally, we provide new insights into the…

We explicitly determine the Ap\'ery limits for the sums of powers of binomial coefficients. As an application, we prove a weak version of Franel's conjecture on the order of the recurrences for these sequences. Namely, we prove the…

The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…