Algorithms for Bernoulli numbers and Euler numbers
From MaRDI portal
The author proposes new recursive algorithms which produce Bernoulli numbers, Euler numbers, and tangent numbers. Expressions of the Euler numbers and tangent numbers in terms of Stirling numbers of the second kind are also found.
Recommendations
Cited in
(11)- The Akiyama-Tanigawa matrix and related combinatorial identities
- An extension of the Euler-Maclaurin quadrature formula using a parametric type of Bernoulli polynomials
- On \(p\)-Bernoulli numbers and polynomials
- Faster computation of Bernoulli numbers
- scientific article; zbMATH DE number 1557041 (Why is no real title available?)
- Combinatorial properties of poly-Bernoulli relatives
- Algorithms for Bernoulli and related polynomials
- Fast computation of Bernoulli, tangent and secant numbers
- The triangle algorithm for Bernoulli polynomials
- A new representation formula for the Bernoulli numbers
- Generalized Fubini transform with two variables
This page was built for publication: Algorithms for Bernoulli numbers and Euler numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2736388)