Explicit formulas for computing Bernoulli numbers of the second kind and Stirling numbers of the first kind

Content Provider	Semantic Scholar
Author	Qi, Feng
Copyright Year	2014
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.
File Format	PDF HTM / HTML
Alternate Webpage(s)	http://www.pmf.ni.ac.rs/pmf/publikacije/filomat/2014/28-2/F28-2-11.pdf
Alternate Webpage(s)	http://www.doiserbia.nb.rs/img/doi/0354-5180/2014/0354-51801402319O.pdf
Language	English
Access Restriction	Open
Subject Keyword	Computation (action) Euler–Bernoulli beam theory Recursion Sense of identity (observable entity)
Content Type	Text
Resource Type	Article