No label defined (Q4526769)

The Akiyama-Tanigawa algorithm for Bernoulli numbers is defined by the recursively determined numbers \(a_{n+1,m}=(m+1)\cdot (a_{n,m}-a_{n,m+1})\), where \(m\), \(n\) are non-negative integers and \(a_{0,m}=1/(m+1)\) [\textit{S. Akiyama} and \textit{Y. Tanigawa}, preprint (1999), see also Acta Arith. 98, 107-116 (2001; Zbl 0972.11085)]. Then the Bernoulli number \(B_n\) (in even suffix notation) equals \(a_{n,0}\). The author presents a direct proof of this algorithm based on a formula for \(B_n\) in terms of the Stirling numbers of the second kind. It is also shown that for \(a_{0,m}=1/(m+k)^k\) \((k\) is an integer) we get \(a_{n,0}=(-1)^nD^{(k)}_n\), where \(D^{(k)}_n\) is a variant of poly-Bernoulli numbers [\textit{M. Kaneko}, J. Théor. Nombres Bordx. 9, 221-228 (1997; Zbl 0887.11011)].