Related papers: Connecting the Stirling numbers and $k$-bonacci su…
By changing variables in a suitable way and using dominated convergence methods, this note gives a short proof of Stirling's formula and its refinement.
We study inverse factorial series and their relation to Stirling numbers of the first kind. We prove a special representation of the polylogarithm function in terms of series with such numbers. Using various identities for Stirling numbers…
Stirling's formula is a powerful asymptotic approximation of the factorial function. Many well-known proofs of this formula are grounded in integral calculus. In this paper, we present an alternative proof of Stirling's formula using only…
A new simple proof of Stirling's formula via the partial fraction expansion for the tangent function is presented.
This is a historical introduction to the theory of Stirling numbers of the second kind S(n,k) from the point of view of analysis. We tell the story of their birth in the book of James Stirling (1730) and show how they mature in the works of…
This paper presents a family of rapidly convergent summation formulas for various finite sums of analytic functions. These summation formulas are obtained by applying a series acceleration transformation involving Stirling numbers of the…
A formula on Stirling numbers of the second kind $S(n, k)$ is proved. As a corollary, for odd $n$ and even $k$, it is shown that $k!S(n, k)$ is a positive multiple of the greatest common divisor of $j!S(n, j)$ for $k+1\leq j\leq n$. Also,…
We introduce and study a new notion of patterns in Stirling and $k$-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns…
Recent developments of Baxter algebras have lead to applications to combinatorics, number theory and mathematical physics. We relate Baxter algebras to Stirling numbers of the first kind and the second kind, partitions and multinomial…
By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…
This paper shows that a finite discrete convolution involving Stirling numbers of both kinds and harmonic numbers can be expressed in terms of the Bernoulli numbers. As applications of this expression, the linear recurrence relation for the…
We introduce the $B$-Stirling numbers of the first and second kind, which are the coefficients of the potential polynomials when we express them in terms of the monomials and the falling factorials, respectively. These numbers include, as…
This paper presents a family of rapidly convergent summation formulas for various finite sums of the form $\sum_{k=0}^{\lfloor x\rfloor}f(k)$, where $x$ is a positive real number.
We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…
We generalize the Stirling numbers of the first kind $s(a,k)$ to the case where $a$ may be an arbitrary real number. In particular, we study the case in which $a$ is an integer. There, we discover new combinatorial properties held by the…
We present a survey on recent results about Stirling's formula. More exactly, we reffer to a method using a form of Cesaro-Stolz lemma firstly introduced in [C. Mortici Product approximations via asymptotic integration Amer. Math. Monthly…
Recently, the degenerate Stirling numbers of the first kind were introduced. In this paper, we give some formulas for the degenerate Stirling numbers of the first kind in the terms of the complete Bell polynomials with higher-order harmonic…
We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…
In the paper, the author finds an explicit formula for computing Bernoulli numbers of the second kind in terms of Stirling numbers of the first kind.
In the paper we present some new inversion formulas and two new formulas for Stirling numbers.