Related papers: Further Classes of Series Involving Central Binomi…
In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit…
$q$-Analogues of the coefficients of $x^a$ in the expansion of $\prod_{j=1}^N (1+x+...+x^j)^{L_j}$ are proposed. Useful properties, such as recursion relations, symmetries and limiting theorems of the ``$q$-supernomial coefficients'' are…
We prove four identities for the squared central binomial coefficients. The first three of them reflect certain transformation properties of the complete elliptic integrals of the first and the second kind, while the last one is based on…
By using the associated and restricted Stirling numbers of the second kind, we give some generalizations of the poly-Bernoulli numbers. We also study their arithmetical and combinatorial properties. As an application, at the end of the…
Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…
In this work we introduce interesting infinite series, related to Ramanujan-Soldner constant. Our method uses general properties of polynomials of binomial type and Lagrange inversion theorem. Also we study properties of the operator…
The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…
We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.
In this paper we study the development in Taylor series of the function $f(x)=x^x$. First section establishes a recursive relationship among successive derivatives of the function by using the coefficients defined therein. From recursion…
The definition of the binomial coefficient in terms of gamma functions also allows non-integer arguments. For nonnegative integer arguments the gamma functions reduce to factorials, leading to the well-known Pascal triangle. Using a…
A class of self-inversive polynomials includes all the self-reciprocal polynomials. Let A denote the set of all self-reciprocal polynomials with n+1 coefficients. Let B denote the set of certain self-inversive and non self-reciprocal…
A product difference equation is proved and used for derivation by elementary methods of four combinatorial identities, eight combinatorial identities involving generalized harmonic numbers and eight combinatorial identities involving…
We define a special function related to the digamma function and use it to evaluate in closed form various series involving binomial coefficients and harmonic numbers.
We show how to get explicit induction formulae for finite group representations, and more generally for rational Green functors, by summing a divergent series over Dwyer's subgroup and centralizer decomposition spaces. This results in…
We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…
We introduce the degenerate Bernoulli numbers of the second kind as a degenerate version of the Bernoulli numbers of the second kind. We derive a family of nonlinear differential equations satisfied by a function closely related to the…
In this paper, we find an elementary approach for double sums where the inner sum is binomial but incomplete. We apply our core identity and its relatives to double sums involving famous numbers such as harmonic numbers, Fibonacci numbers,…
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
We investigate a class of combinatorial sums involving reciprocals of central binomial coefficients , employing generating functions as the primary solution technique to formulate and analyze series involving the Catalan's constant. Using a…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…