The AkiyamaTanigawa algorithm for Bernoulli numbers
Abstract
A direct proof is given for Akiyama and Tanigawa's algorithm for computing Bernoulli numbers. The proof uses a closed formula for Bernoulli numbers expressed in terms of Stirling numbers. The outcome of the same algorithm with different initial values is also briefly discussed.
 Publication:

Journal of Integer Sequences
 Pub Date:
 December 2000
 Bibcode:
 2000JIntS...3...29K
 Keywords:

 Number Theory