Algorithms for Bernoulli numbers and Euler numbers

zbMATH Open0973.11021MaRDI QIDQ2736388FDOQ2736388

Authors: Kwang-Wu Chen 

Publication date: 29 August 2001

Published in: Journal of Integer Sequences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/48959

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Computation of Tangent, Euler, and Bernoulli Numbers
• Algorithms for Bernoulli and related polynomials
• Fast computation of Bernoulli, tangent and secant numbers
• A new explicit formula for Bernoulli numbers involving the Euler number
• Faster computation of Bernoulli numbers

zbMATH Keywords

Euler numbersBernoulli numbersStirling numbers of the second kindtangent numbersrecursive algorithms

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Bernoulli and Euler numbers and polynomials (11B68)

Cited In (10)

• On \(p\)-Bernoulli numbers and polynomials
• A new representation formula for the Bernoulli numbers
• Title not available (Why is that?)
• Fast computation of Bernoulli, tangent and secant numbers
• Faster computation of Bernoulli numbers
• The Akiyama-Tanigawa matrix and related combinatorial identities
• Algorithms for Bernoulli and related polynomials
• Combinatorial properties of poly-Bernoulli relatives
• The triangle algorithm for Bernoulli polynomials
• An extension of the Euler-Maclaurin quadrature formula using a parametric type of Bernoulli polynomials

Uses Software

• OEIS

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)