### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 1-7 |

Number of pages | 7 |

Journal | Journal of Integer Sequences |

Volume | 3 |

Issue number | 2 |

Publication status | Published - Dec 1 2000 |

### All Science Journal Classification (ASJC) codes

- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'The Akiyama-Tanigawa algorithm for Bernoulli numbers'. Together they form a unique fingerprint.

## Cite this

Kaneko, M. (2000). The Akiyama-Tanigawa algorithm for Bernoulli numbers.

*Journal of Integer Sequences*,*3*(2), 1-7.