The Akiyama-Tanigawa algorithm for Bernoulli numbers
J. Integer Seq. 3(2), Art. 00.2.9, electronic only (2000)
Summary
Summary: 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.