38
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

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

      Preprint

      Read this article at

          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          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.

          Related collections

          Author and article information

          Journal
          10.2298/FIL1402319O
          1301.6845

          Combinatorics,Number theory
          Combinatorics, Number theory

          Comments

          Comment on this article