2000 character limit reached
Explicit formulas for computing Bernoulli numbers of the second kind and Stirling numbers of the first kind
Published 29 Jan 2013 in math.CO, math.CA, and math.NT | (1301.6845v1)
Abstract: 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 and Stirling numbers of the first kind. As consequences of these formulas, a recursion for Stirling numbers of the first kind and a new representation of the reciprocal of the factorial $n!$ are derived. Finally, the author finds several identities and integral representations relating to Stirling numbers of the first kind.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.