A direct proof is given for Akiyama and Tanigawa'a 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 di erent initial values is also brie y discussed.
|Number of pages||7|
|Journal||Journal of Integer Sequences|
|Publication status||Published - Dec 1 2000|
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics