Related papers: Logarithms of a binomial series: A Stirling number…
In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
For a prime $p$ and nonnegative integers $j$ and $n$ let $\vartheta_p(j,n)$ be the number of entries in the $n$-th row of Pascal's triangle that are exactly divisible by $p^j$. Moreover, for a finite sequence $w=(w_{r-1}\cdots w_0)\neq…
In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…
Let $p$ be a prime and let $a$ be a positive integer. In this paper we investigate $\sum_{k=0}^{p^a-1}\binom[(h+1)k,k+d]/m^k$ modulo a prime $p$, where $d$ and $m$ are integers with $-h<d<=p^a$ and $m\not=0 (mod p)$. We also study…
We introduce the three-Catalan triangle, highlighting the three-Catalan numbers along with their recurrence relation and combinatorial interpretation, which allows us to establish their log-convexity. Additionally, we prove that the rows of…
We present several sequences involving harmonic numbers and the central binomial coefficients. The calculational technique is consists of a special summation method that allows, based on proper two-valued integer functions, to calculate…
The main result of the article says that the formal power series equal to the ratio of two neighboring Chebyshev polynomials, after some renormalization, approximates the generating function of the Catalan numbers. We present a proof of…
In this paper, we study the generating functions of multiple $t$-star values with an arbitrary number of blocks of twos, which are based on the results of the corresponding generating functions of multiple $t$-harmonic star sums. These…
We define the $m$th-order Eulerian numbers with a combinatorial interpretation. The recurrence relation of the $m$th-order Eulerian numbers, the row generating function and the row sums of the $m$th-order Eulerian triangle are presented. We…
We solve a problem of Marshal Hall by proving the convergence of the catalan number generating function directly on the basis of its recursion formula.
We define a new class of generating function transformations related to polylogarithm functions, Dirichlet series, and Euler sums. These transformations are given by an infinite sum over the $j^{th}$ derivatives of a sequence generating…
This paper develops a deeper understanding of the structure and combinatorial significance of the partition function for Hermitian random matrices. The coefficients of the large N expansion of the logarithm of this partition function,also…
The multi-Stirling numbers of the second kind, the unsigned multi-Stirling numbers of the first kind, the multi-Lah numbers and the multi-Bernoulli numbers are all defined with the help of the multiple logarithm, and generalize respectively…
Here we consider the degenerate Bernstein polynomials as a degenerate version of Bernstein polynomials, which are motivated by Simsek's recent work 'Generating functions for unification of the multidimensional Bernstein polynomials and…
The goal of the paper is to give a systematic way to numerically evaluate the generating function of a periodic multiple polylogarithm using a Chen-Fliess series with a rational generating series. The idea is to realize the corresponding…
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…
In this paper, we consider properties of coefficients of a generating functions composition, where the outer function is a logarithmic generating function and the inner function is an ordinary generating function with integer coefficients.…
In this paper, we introduce a new class of polynomials, called probabilistic q-Bernstein polynomials, alongside their generating function. Assuming Y is a random variable satisfying moment conditions, we use the generating function of these…
We describe proofs of the standard generating formulas for unsigned and signed Stirling numbers of the first kind that follow from a natural combinatorial interpretation based on cycle-colored permutations.