In this work, the authors present several formulas which compute the following Euler's type and Dilcher's type sums of the products of Bernoulli numbers B n : respectively, where denotes, as usual, the multinomial coefficient.
Faster computation of Bernoulli numbers
โ Scribed by Sandra Fillebrown
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 689 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Closed expressions are obtained for sums of products of Bernoulli numbers of the form ( 2n 2j 1 , ..., 2jN ) B 2j1 } } } B 2jN , where the summation is extended over all nonnegative integers j 1 , ..., j N with j 1 + j 2 + } } } + j N =n. Corresponding results are derived for Bernoulli polynomials,
We extend a well-known formula for sums of products of two Bernoulli numbers to that of Carlitz's q-Bernoulli numbers. Recently Dilcher (J. Number Theory 60 (1996), 23 41) generalized the formula for sums of products of any number of Bernoulli numbers, but it is not easy to prove the generalized for
A class of generating functions based on the Padรฉ approximants of the exponential function gives a doubly infinite class of number and polynomial sequences. These generalize the Bernoulli numbers and polynomials, as well as other sequences found in the literature. We derive analogues of the Kummer c
We give an easy proof of a recently published recurrence for the Bernoulli numbers and we present some applications of the recurrence. One of the applications is a simple proof of the well-known Staudt-Clausen Theorem. Proofs are also given for theorems of Carlitz. Frobenius, and Ramanujan. An analo