About the Project
24 Bernoulli and Euler PolynomialsProperties

§24.14 Sums

Contents
  1. §24.14(i) Quadratic Recurrence Relations
  2. §24.14(ii) Higher-Order Recurrence Relations
  3. §24.14(iii) Compendia

§24.14(i) Quadratic Recurrence Relations

24.14.1 k=0n(nk)Bk(x)Bnk(y) =n(x+y1)Bn1(x+y)(n1)Bn(x+y),
24.14.2 k=0n(nk)BkBnk =(1n)BnnBn1.
24.14.3 k=0n(nk)Ek(h)Enk(x) =2(En+1(x+h)(x+h1)En(x+h)),
24.14.4 k=0n(nk)EkEnk =2n+1En+1(0)=2n+2(12n+2)Bn+2n+2.
24.14.5 k=0n(nk)Ek(h)Bnk(x) =2nBn(12(x+h)),
24.14.6 k=0n(nk)2kBkEnk =2(12n1)BnnEn1.

Let m+n be even with m and n nonzero. Then

24.14.7 j=0mk=0n(mj)(nk)BjBkm+njk+1=(1)m1m!n!(m+n)!Bm+n.

§24.14(ii) Higher-Order Recurrence Relations

In the following two identities, valid for n2, the sums are taken over all nonnegative integers j,k, with j+k+=n.

24.14.8 (2n)!(2j)!(2k)!(2)!B2jB2kB2 =(n1)(2n1)B2n+n(n12)B2n2,
24.14.9 (2n)!(2j)!(2k)!(2)!E2jE2kE2 =12(E2nE2n+2).

In the next identity, valid for n4, the sum is taken over all positive integers j,k,,m with j+k++m=n.

24.14.10 (2n)!(2j)!(2k)!(2)!(2m)!B2jB2kB2B2m=(2n+33)B2n43n2(2n1)B2n2.

For (24.14.11) and (24.14.12), see Al-Salam and Carlitz (1959). These identities can be regarded as higher-order recurrences. Let det[ar+s] denote a Hankel (or persymmetric) determinant, that is, an (n+1)×(n+1) determinant with element ar+s in row r and column s for r,s=0,1,,n. Then

24.14.11 det[Br+s] =(1)n(n+1)/2(k=1nk!)6/(k=12n+1k!),
24.14.12 det[Er+s] =(1)n(n+1)/2(k=1nk!)2.

See also Sachse (1882).

§24.14(iii) Compendia

For other sums involving Bernoulli and Euler numbers and polynomials see Hansen (1975, pp. 331–347) and Prudnikov et al. (1990, pp. 383–386).

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy