The Akiyama-Tanigawa algorithm for Bernoulli numbers
Journal of integer sequences, Tome 3 (2000) no. 2.

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

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.
@article{JIS_2000__3_2_a1,
     author = {Kaneko, Masanobu},
     title = {The {Akiyama-Tanigawa} algorithm for {Bernoulli} numbers},
     journal = {Journal of integer sequences},
     publisher = {mathdoc},
     volume = {3},
     number = {2},
     year = {2000},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JIS_2000__3_2_a1/}
}
TY  - JOUR
AU  - Kaneko, Masanobu
TI  - The Akiyama-Tanigawa algorithm for Bernoulli numbers
JO  - Journal of integer sequences
PY  - 2000
VL  - 3
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JIS_2000__3_2_a1/
LA  - en
ID  - JIS_2000__3_2_a1
ER  - 
%0 Journal Article
%A Kaneko, Masanobu
%T The Akiyama-Tanigawa algorithm for Bernoulli numbers
%J Journal of integer sequences
%D 2000
%V 3
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JIS_2000__3_2_a1/
%G en
%F JIS_2000__3_2_a1
Kaneko, Masanobu. The Akiyama-Tanigawa algorithm for Bernoulli numbers. Journal of integer sequences, Tome 3 (2000) no. 2. http://geodesic.mathdoc.fr/item/JIS_2000__3_2_a1/