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 .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.