๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Convolution identities and lacunary recurrences for Bernoulli numbers

โœ Scribed by Takashi Agoh; Karl Dilcher


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
169 KB
Volume
124
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

โœฆ Synopsis


We extend Euler's well-known quadratic recurrence relation for Bernoulli numbers, which can be written in symbolic notation as (B 0 + B 0 ) n = -nB n-1 -(n -1)B n , to obtain explicit expressions for (B k + B m ) n with arbitrary fixed integers k, m 0. The proof uses convolution identities for Stirling numbers of the second kind and for sums of powers of integers, both involving Bernoulli numbers. As consequences we obtain new types of quadratic recurrence relations, one of which gives B 6k depending only on B 2k , B 2k+2 , . . . , B 4k .


๐Ÿ“œ SIMILAR VOLUMES


Some Identities Involving Bernoulli and
โœ Susumu Shirai; Ken-ichi Sato ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 117 KB

In this paper we prove some identities involving Bernoulli and Stirling numbers, relation for two or three consecutive Bernoulli numbers, and various representations of Bernoulli numbers.

Applications of a Recurrence for the Ber
โœ F.T. Howard ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 416 KB

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

Congruences for Bernoulli numbers and Be
โœ Zhi-Hong Sun ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 292 KB

Let {B.(x)} be the well-known Bernoulli polynemials. It is the purpose of this paper to determine pB~p-t~+b(x)modp ", where p is a prime, k, b nonnegative integers and x a rational p-integer. It is interesting to investigate arithmetic properties of {B,} and {Bn(x)}. For the work on this line one ma