Related papers: Connecting the Stirling numbers and $k$-bonacci su…
Associated to each random variable $Y$ having a finite moment generating function, we introduce a different generalization of the Stirling numbers of the second kind. Some characterizations and specific examples of such generalized numbers…
We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the…
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…
Through a brute-force approach to calculating the higher derivatives of the falling factorial function, a number of interesting quantities were obtained and analyzed. In particular, it was found that a quantity that can be described as the…
In the paper, by establishing a new and explicit formula for computing the $n$-th derivative of the reciprocal of the logarithmic function, the author presents new and explicit formulas for calculating Bernoulli numbers of the second kind…
The Jacobi-Stirling numbers of the first and second kinds were introduced in 2006 in the spectral theory and are polynomial refinements of the Legendre-Stirling numbers. Andrews and Littlejohn have recently given a combinatorial…
In this paper we study q-Bernoulli numbers and polynomials related to q-Stirling numbers. From thsese studying we investigate some interesting q-stirling numbers' identities related to q-Bernoulli numbers.
In this paper, we study some combinations of the degenerate and incomplete Stirling numbers of the second kind. We use a combinatorial approach and provide some asymptotic results.
We present a proof given by Euler in his paper {\it ``De serierum determinatione seu nova methodus inveniendi terminos generales serierum"} \cite{E189} (E189:``On the determination of series or a new method of finding the general terms of…
This article demonstrates, using numerous examples of varying complexity, how one can visually prove summation formulas involving binomial coefficients by exclusively using the recurrence relation for binomial coefficients and its…
Recently, Kargin et al. (arXiv:2008.00284 [math.NT]) obtained (among many other things) the following formula for the hyper-sums of powers of integers $S_k^{(m)}(n)$ \begin{equation*} S_k^{(m)}(n) = \frac{1}{m!} \sum_{i=0}^{m} (-1)^i…
We establish a new identity linking Bernoulli, Stirling (first kind), and Bessel (first kind) numbers: \[ \sum_{k=0}^{n} 2^{\,n-k}\,s(n,k)\,B_k \;=\; \sum_{k=0}^{n} b(n,k)\,\frac{(-1)^k\,k!}{k+1}. \] This parallels the classical…
We present various identities in the form of convolutions involving Stirling numbers of both kinds, Lah numbers, and binomial coefficients. Certain convolution polynomials are discussed also. The proofs are based on several series…
We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.
In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…
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.
We study set partitions with $r$ distinguished elements and block sizes found in an arbitrary index set $S$. The enumeration of these $(S,r)$-partitions leads to the introduction of $(S,r)$-Stirling numbers, an extremely wide-ranging…
The aim of this paper is to study the $\lambda$-Stirling numbers of both kinds which are $\lambda$-analogues of Stirling numbers of both kinds. Those numbers have nice combinatorial interpretations when $\lambda$ are positive integers. If…
The Stirling approximation formula for $n!$ dates from 1730. Here we give new and instructive proofs of this and related approximation formulae via tools of probability and statistics. There are connections to the Central Limit Theorem and…
Four new relations have been found between the Stirling numbers of first and second kind. They are derived directly from recently published relations.