1 Introduction

The Gegenbauer polynomials are given in terms of the Jacobi polynomials P n ( α , β ) (x) with α=β=λ 1 2 (λ> 1 2 , λ0) by

C n ( λ ) ( x ) = Γ ( λ + 1 2 ) Γ ( n + 2 λ ) Γ ( 2 λ ) Γ ( n + λ + 1 2 ) P n ( λ 1 2 , λ 1 2 ) ( x ) = ( n + 2 λ 1 n ) k = 0 n ( n k ) ( 2 λ + n ) k ( λ + 1 2 ) k ( x 1 2 ) k ,
(1.1)

where ( a ) k =a(a+1)(a+2)(a+k1) (see [1, 2]).

From (1.1), we note that C k ( λ ) (x) is a polynomial of degree n with real coefficients and C n ( λ ) (1)= ( n + 2 λ 1 n ) . The leading coefficient of C n ( λ ) (x) is 2 n ( λ + n 1 n ) . By the theory of Jacobi polynomials with α=β=λ 1 2 , λ> 1 2 , and λ0, we get

C n ( λ ) (x)= ( 1 ) n C n ( λ ) (x).
(1.2)

It is not difficult to show that C n ( λ ) (x) is a solution of the following Gegenbauer differential equation:

( 1 x 2 ) y (2λ+1)x y +n(n+2λ)y=0.

The Rodrigues formula for the Gegenbauer polynomials is well known as the following:

( 1 x 2 ) λ 1 2 C n ( λ ) (x)= ( 2 ) n ( λ ) n n ! ( n + 2 λ ) n ( d d x ) n ( 1 x 2 ) n + λ 1 2 (see [3, 4]).
(1.3)

Equation (1.3) can be easily derived from the properties of Jacobi polynomials.

As is well known, the generating function of Gegenbauer polynomials is given by

2 λ 1 2 ( 1 2 x t + t 2 ) 1 2 ( 1 x t + 1 2 x t + t 2 ) λ 1 2 = n = 0 ( λ + 1 2 ) n ( 2 λ ) n C n ( λ ) (x) t n .
(1.4)

Equation (1.4) can be also derived from the generating function of Jacobi polynomials.

From (1.4), we note that

1 ( 1 2 x t + t 2 ) λ = n = 0 C n ( λ ) (x) t n ( | t | < 1 , | x | 1 ) .
(1.5)

The proof of (1.5) is given in the following book: Stein and Weiss, Introduction to Fourier Analysis in Euclidean Space, Princeton University Press, 1971.

By (1.1) and (1.2), we get

1 1 C n ( λ ) (x) C m ( λ ) (x) ( 1 x 2 ) λ 1 2 dx= π 2 1 2 λ Γ ( n + 2 λ ) n ! ( n + λ ) ( Γ ( λ ) ) 2 δ m , n ,
(1.6)

where δ m , n is the Kronecker symbol and it holds for each fixed λR with λ> 1 2 and λ0.

Equation (1.6) implies the orthogonality of C n ( λ ) (x) and equation (1.6) is important in deriving our results in this paper. From (1.5), we can derive the following derivative of Gehenbauer polynomials C n ( λ ) (x):

d d x C n ( λ ) (x)=2λ C n 1 ( λ + 1 ) (x),for n1.
(1.7)

By (1.7), we get

d k d x k C n ( λ ) (x)= 2 k λ k C n k ( λ + k ) (x).
(1.8)

As is well known, the Bernoulli polynomials B n (x) are defined by the generating function to be

t e t 1 e x t = e B ( x ) t = n = 0 B n (x) t n n ! (see [5–13]),
(1.9)

with the usual convention about replacing B n (x) by B n (x). In the special case, x=0, B n (0)= B n are called the n th Bernoulli numbers.

From (1.9), we note that

B n (x)= ( B + x ) n = l = 0 n ( n l ) B n l x l (see [9–13]),
(1.10)

and

B n (x)= d d x B n (x)=n B n 1 (x).
(1.11)

The Euler polynomials E n (x) are also defined by the generating function to be

2 e t + 1 e x t = e E ( x ) t = n = 0 E n (x) t n n ! (see [4, 14–18]),
(1.12)

with the usual convention about replacing E n (x) by E n (x). In the special case, x=0, E n (0)= E n are called the n th Euler numbers. By (1.12), we see that the recurrence formula for E n is given by

E 0 =1, ( E + 1 ) n + E n =2 δ 0 , n (see [19–21]).
(1.13)

For each fixed λR with λ> 1 2 and λ0, let P n ={p(x)R[x]degp(x)n} be an inner product space with respect to the inner product

p 1 ( x ) , p 2 ( x ) = 1 1 ( 1 x 2 ) λ 1 2 p 1 (x) p 2 (x)dx,
(1.14)

where p 1 (x), p 2 (x) P n . The information entropy of Gegenbauer polynomials is relevant since it is related to the angular part of the information entropies of certain quantum mechanical systems such as the harmonic oscillator and the hydrogen atom in D dimensions. In [7], Buyarov, Lopez-Artes, Martinez-Finkelshtein, and Van Assche gave an effective method to compute the entropy for Gegenbauer polynomials with an integer parameter and obtain the first few terms in the asymptotic expansion as the degree of the polynomial tends to infinity. That is, an efficient method was provided for evaluating, in a closed form, the information entropy of the Gegenbauer polynomials C n ( λ ) (x) in the case when . For given values of n and l, this method requires the computation by means of recurrence relations of two auxiliary polynomials, P(x) and H(x), of degrees 2l2 and 2l4, respectively (see [18]). In [18], Sanchez-Ruiz showed that P(x) is related to the coefficients of the Gaussian quadrature formula for the Gegenbauer weights w l (x)= ( 1 x 2 ) l 1 2 , and this fact is used to obtain the explicit expression of P(x). The position and momentum information entropies of D-dimensional quantum systems with central potentials, such as the isotropic harmonic oscillator and the hydrogen atom, depend on the entropies of the (hyper)spherical harmonics (see [2]). In turn, these entropies are expressed in terms of the entropies of the Gegenbauer (ultraspherical) polynomials C n ( λ ) (x), the parameter λ being either an integer or a half-integer number. Up to now, however, the exact analytical expression of the entropy of Gegenbauer polynomials of arbitrary degree n has only been obtained for the particular values of the parameter λ=0,1,2 (see [2]). In [2], de Vicente, Gandy, Sanchez-Ruiz presented a novel approach to the evaluation of the information entropy of Gegenbauer polynomials, which makes use of trigonometric representations for these polynomials and complex integration techniques. Using this method, we are able to find the analytical expression of the entropy for arbitrary values of both n and λN (see [2]). The Gegenbauer polynomial seems to be interesting and important in the area of mathematical physics. Recently, many authors have studied Gegenbauer polynomials related to mathematical physics (see [15, 7, 10, 11, 14, 18, 21, 22]). In this paper, we derive some interesting identities involving Gegenbauer polynomials arising from the orthogonality of those for the inner product space P n with respect to the weighted inner product p 1 , p 2 = 1 1 p 1 (x) p 2 (x) ( 1 x 2 ) λ 1 2 dx.

Our methods used in this paper are useful in finding some new identities and relations on the Bernoulli and Euler polynomials involving Gegenbauer polynomials.

2 Some identities involving Gegenbauer polynomials

Let us take p(x)= k = 0 n d k C k ( λ ) (x) P n , d k R. Then, by (1.6) and (1.14), we get

p ( x ) , C k ( λ ) ( x ) = d k C k ( λ ) ( x ) , C k ( λ ) ( x ) = d k 1 1 ( 1 x 2 ) λ 1 2 C k ( λ ) ( x ) C k ( λ ) ( x ) d x = d k π 2 1 2 λ Γ ( k + 2 λ ) k ! ( k + λ ) ( Γ ( λ ) ) 2 .
(2.1)

Thus, from (2.1), we have

d k = ( Γ ( λ ) ) 2 k ! ( k + λ ) π 2 1 2 λ Γ ( k + 2 λ ) 1 1 ( 1 x 2 ) λ 1 2 p(x) C k ( λ ) (x)dx.
(2.2)

By (1.3) and (2.2), we get

d k = ( Γ ( λ ) ) 2 k ! ( k + λ ) π 2 1 2 λ Γ ( k + 2 λ ) × ( 2 ) k ( λ ) k k ! ( k + 2 λ ) k 1 1 ( d k d x k ( 1 x 2 ) k + λ 1 2 ) p ( x ) d x = ( k + λ ) Γ ( λ ) ( 2 ) k π Γ ( k + λ + 1 2 ) 1 1 ( d k d x k ( 1 x 2 ) k + λ 1 2 ) p ( x ) d x .
(2.3)

Therefore, by (2.3), we obtain the following proposition.

Proposition 2.1 Forp(x) P n , let

p(x)= n = 0 n d k C k ( λ ) (x)( d k R).

Then

d k = ( k + λ ) Γ ( λ ) ( 2 ) k π Γ ( k + λ + 1 2 ) 1 1 ( d k d x k ( 1 x 2 ) k + λ 1 2 ) p(x)dx.

For example, let p(x)= x n P n . From Proposition 2.1, we note that

d k = ( k + λ ) Γ ( λ ) ( 2 ) k π Γ ( k + λ + 1 2 ) 1 1 ( d k d x k ( 1 x 2 ) k + λ 1 2 ) x n d x = ( n ) 1 1 ( d k 1 d x k 1 ( 1 x 2 ) k + λ 1 2 ) x n 1 d x × ( ( k + λ ) Γ ( λ ) π ( 2 ) k Γ ( k + λ + 1 2 ) ) = = ( k + λ ) n ! Γ ( λ ) ( n k ) ! 2 k π ( k + 1 2 + λ ) 1 1 ( 1 x 2 ) k + λ 1 2 x n k d x = ( 1 + ( 1 ) n k ) ( k + λ ) n ! Γ ( λ ) ( n k ) ! 2 k π Γ ( k + 1 2 + λ ) 0 1 ( 1 x 2 ) k + λ 1 2 x n k d x .
(2.4)

Let us assume that nk0 (mod2). Then, by (2.4), we get

d k = ( k + λ ) n ! Γ ( λ ) ( n k ) ! 2 k π Γ ( k + 1 2 + λ ) B ( k + λ + 1 2 , n k + 1 2 ) = Γ ( n k + 1 2 ) Γ ( k + λ + 1 2 ) Γ ( n + k + 2 λ + 2 2 ) ,
(2.5)

where B(α,β) is the beta function which is defined by B(α,β)= Γ ( α ) Γ ( β ) Γ ( α + β ) .

It is easy to show that

Γ ( n k + 1 2 ) = n k 1 2 Γ ( n k 1 2 ) = ( n k 1 2 ) ( n k 3 2 ) Γ ( n k 3 2 ) = = ( n k 2 ) ( n k 1 2 ) ( n k 2 2 ) 2 2 Γ ( 1 2 ) ( n k 2 ) ( n k 2 2 ) ( 2 2 ) = ( n k ) ! π 2 n k ( n k 2 ) ! .
(2.6)

Therefore, by (2.5) and (2.6), we obtain the following identity:

x n = 0 k n , n k 0 ( mod 2 ) ( k + λ ) n ! Γ ( λ ) 2 n ( n k 2 ) ! Γ ( n + k + 2 λ + 2 2 ) C k ( λ ) (x).
(2.7)

Let us take p(x)= B n (x) P n . Then, by (1.10), we get

d k = ( k + λ ) Γ ( λ ) ( 2 ) k π Γ ( k + λ + 1 2 ) 1 1 ( d k d x k ( 1 x 2 ) k + λ 1 2 ) B n ( x ) d x = ( k + λ ) Γ ( λ ) ( n ) ( 2 ) k π Γ ( k + λ + 1 2 ) 1 1 ( d k 1 d x k 1 ( 1 x 2 ) k + λ 1 2 ) B n 1 ( x ) d x = = ( k + λ ) Γ ( λ ) ( n ) ( ( n 1 ) ) ( ( n k + 1 ) ) ( 2 ) k π Γ ( k + λ + 1 2 ) 1 1 ( 1 x 2 ) k + λ 1 2 B n k ( x ) d x = ( k + λ ) Γ ( λ ) 2 k π Γ ( k + λ + 1 2 ) × n ! ( n k ) ! 1 1 ( 1 x 2 ) k + λ 1 2 B n k ( x ) d x .
(2.8)

From (1.10) and (2.7), we can derive the following equation:

1 1 ( 1 x 2 ) k + λ 1 2 B n k ( x ) d x = l = 0 n k ( n k l ) B n k l 1 1 ( 1 x 2 ) k + λ 1 2 x l d x = l = 0 n k ( n k l ) B n k l ( 1 + ( 1 ) l ) 0 1 ( 1 x 2 ) k + λ 1 2 x l d x .
(2.9)

Let us consider that l0 (mod2). Then, by (2.9), we get

1 1 ( 1 x 2 ) k + λ 1 2 B n k ( x ) d x = 2 0 l n k , l 0 ( mod 2 ) ( n k l ) B n k l 0 1 ( 1 x 2 ) k + λ 1 2 x l d x = 0 l n k , l 0 ( mod 2 ) ( n k l ) B n k l 0 1 ( 1 y ) k + λ 1 2 y l 1 2 d y = 0 l n k , l 0 ( mod 2 ) ( n k l ) B n k l Γ ( k + λ + 1 2 ) Γ ( l + 1 2 ) Γ ( 2 k + 2 λ + l + 2 2 ) .
(2.10)

For l Z + with l0 (mod2), we have

Γ ( l + 1 2 ) = Γ ( l 1 2 + 1 ) = l 1 2 Γ ( l 1 2 ) = ( l 1 2 ) ( l 3 2 ) Γ ( l 3 2 ) = = ( l 1 2 ) ( l 3 2 ) ( 1 2 ) Γ ( 1 2 ) = ( 1 2 ) l l ! Γ ( 1 2 ) ( l 2 ) ! = l ! π 2 l ( l 2 ) ! .
(2.11)

By (2.10) and (2.11), we get

1 1 ( 1 x 2 ) k + λ 1 2 B n k ( x ) d x = 0 l n k , l 0 ( mod 2 ) ( n k l ) B n k l Γ ( k + λ + 1 2 ) Γ ( l + 1 2 ) Γ ( 2 k + 2 λ + l + 2 2 ) = 0 l n k , l 0 ( mod 2 ) ( n k l ) B n k l l ! π 2 l ( l 2 ) ! × Γ ( k + λ + 1 2 ) Γ ( 2 k + 2 λ + l + 2 2 ) .
(2.12)

From (2.8) and (2.12), we have

d k = n ! ( k + λ ) Γ ( λ ) 2 k ( n k ) ! 0 l n k , l 0 ( mod 2 ) ( n k l ) B n k l l ! 2 l ( l 2 ) ! Γ ( 2 k + 2 λ + l + 2 2 ) .
(2.13)

Therefore, by (2.13) and Proposition 2.1, we obtain the following theorem.

Theorem 2.2 Forn Z + , we have

B n ( x ) n ! =Γ(λ) k = 0 n ( ( k + λ ) 2 k ( n k ) ! 0 l n k , l 0 ( mod 2 ) ( n k l ) B n k l l ! 2 l ( l 2 ) ! Γ ( 2 k + 2 λ + l + 2 2 ) ) C k ( λ ) (x).

By the same method, we get

E n ( x ) n ! =Γ(λ) k = 0 n ( ( k + λ ) 2 k ( n k ) ! 0 l n k , l 0 ( mod 2 ) ( n k l ) E n k l l ! 2 l ( l 2 ) ! Γ ( 2 k + 2 λ + l + 2 2 ) ) C k ( λ ) (x).
(2.14)

From (1.1), we note that

C n k ( λ ) ( x ) C k ( λ ) ( x ) = ( n k + 2 λ 1 n k ) l = 0 n k ( n k l ) ( 2 λ + n k ) l ( λ + 1 2 ) l ( x 1 2 ) l ( k + 2 λ 1 k ) × m 0 k ( k m ) ( 2 λ + k ) m ( λ + 1 2 ) m ( x 1 2 ) m = ( n k + 2 λ 1 n k ) ( k + 2 λ 1 k ) × p = 0 n ( m = 0 p ( n k p m ) ( k m ) ( 2 λ + k ) m ( 2 λ + n k ) p m ( λ + 1 2 ) m ( λ + 1 2 ) p m ) ( x 1 2 ) p .
(2.15)

Let us take p(x)= C k ( λ ) (x) C n k ( λ ) (x) P n . From Proposition 2.1, p(x) can be rewritten as

p(x)= C k ( λ ) (x) C n k ( λ ) (x)= r = 0 n d r C r ( λ ) (x)( d r R).
(2.16)

Then, by Proposition 2.1 and (2.15), we get

d r = ( r + λ ) Γ ( λ ) ( 2 ) r π Γ ( r + λ + 1 2 ) 1 1 ( d r d x r ( 1 x 2 ) r + λ 1 2 ) C k ( λ ) ( x ) C n k ( λ ) ( x ) d x = ( r + λ ) Γ ( λ ) ( 2 ) r π Γ ( r + λ + 1 2 ) ( n k + 2 λ 1 n k ) ( k + 2 λ 1 k ) × p = 0 n ( m = 0 p ( n k p m ) ( k m ) ( 2 λ + k ) m ( λ + 1 2 ) m ( λ + 1 2 ) p m ( 2 λ + n k ) p m ) × 1 1 ( d r d x r ( 1 x 2 ) r + λ 1 2 ) ( x 1 2 ) p d x = ( r + λ ) Γ ( λ ) ( 2 ) r π Γ ( r + λ + 1 2 ) ( n k + 2 λ 1 n k ) ( k + 2 λ 1 k ) × p = r n ( m = 0 p ( n k p m ) ( k m ) ( 2 λ + k ) m ( λ + 1 2 ) m ( λ + 1 2 ) p m ( 2 λ + n k ) p m ) × 1 1 ( d r d x r ( 1 x 2 ) r + λ 1 ) ( x 1 2 ) p d x .
(2.17)

It is not difficult to show that

1 1 ( d r d x r ( 1 x 2 ) r + λ 1 2 ) ( x 1 2 ) p d x = ( 1 ) r p ! 2 p ( p r ) ! 1 1 ( 1 x 2 ) r + λ 1 2 ( 1 x ) p r ( 1 ) p r d x = ( 1 ) p p ! 2 p ( p r ) ! 1 1 ( 1 x ) p + λ 1 2 ( 1 + x ) r + λ 1 2 d x = ( 1 ) p p ! 2 p ( p r ) ! 0 1 ( 2 2 y ) p + λ 1 2 ( 2 y ) r + λ 1 2 2 d y = ( 1 ) p 2 p + λ 1 2 + r + λ 1 2 + 1 2 p × p ! ( p r ) ! 0 1 ( 1 y ) p + λ 1 2 y r + λ 1 2 d y = ( 1 ) p 2 r + 2 λ p ! ( p r ) ! × Γ ( p + λ + 1 2 ) Γ ( r + λ + 1 2 ) Γ ( r + p + 2 λ + 1 ) .
(2.18)

From the fundamental theorem of gamma function, we have

Γ ( p + λ + 1 2 ) Γ ( r + p + 2 λ + 1 ) = ( p + λ 1 2 ) ( λ + 1 2 ) Γ ( λ + 1 2 ) ( r + p + 2 λ ) 2 λ Γ ( 2 λ ) = ( λ + 1 2 ) p π 2 1 λ ( 2 λ ) r + p + 1 Γ ( λ ) .
(2.19)

By (2.18) and (2.19), we get

1 1 ( d r d x r ( 1 x 2 ) r + λ 1 2 ) ( x 1 2 ) p d x = ( 1 ) p 2 r + 2 λ p ! ( p r ) ! × Γ ( p + λ + 1 2 ) Γ ( r + λ + 1 2 ) Γ ( r + p + 2 λ + 1 ) = ( 1 ) p 2 r + 2 λ p ! ( p r ) ! Γ ( r + λ + 1 2 ) × ( λ + 1 2 ) p π 2 1 λ ( 2 λ ) r + p + 1 Γ ( λ ) = ( 1 ) p 2 r + λ + 1 p ! ( p r ) ! Γ ( r + λ + 1 2 ) × ( λ + 1 2 ) p π ( 2 λ ) r + p + 1 Γ ( λ ) .
(2.20)

From (2.17) and (2.20), we have

d r = ( r + λ ) Γ ( λ ) ( 2 ) r π Γ ( r + λ + 1 2 ) ( n k + 2 λ 1 n k ) ( k + 2 λ 1 k ) × p = r n ( m = 0 p ( n k p m ) ( k m ) ( 2 λ + k ) m ( λ + 1 2 ) m ( λ + 1 2 ) p m ( 2 λ + n k ) p m ) × ( 1 ) p 2 r + λ + 1 p ! ( p r ) ! Γ ( λ + 1 2 + r ) × ( λ + 1 2 ) p π ( 2 λ ) r + p + 1 Γ ( λ ) = ( 1 ) r + p 2 λ + 1 ( r + λ ) ( n k + 2 λ 1 n k ) ( k + 2 λ 1 k ) × p = r n ( m = 0 p ( n k p m ) ( k m ) ( 2 λ + k ) m ( λ + 1 2 ) m ( λ + 1 2 ) p m ( 2 λ + n k ) p m p ! ( λ + 1 2 ) p ( p r ) ! ( 2 λ ) r + p + 1 ) .
(2.21)

Therefore, by (2.21), we obtain the following theorem.

Theorem 2.3 Forn,k Z + withnk, we have

C n k ( λ ) ( x ) C k ( λ ) ( x ) = 2 λ + 1 ( n k + 2 λ 1 n k ) ( k + 2 λ 1 k ) r = 0 n p = r n m = 0 p { ( r + λ ) ( 1 ) p + r × ( n k p m ) ( k m ) ( 2 λ + k ) m ( 2 λ + n k ) p m p ! ( λ + 1 2 ) p ( λ + 1 2 ) m ( λ + 1 2 ) p m ( p r ) ! ( 2 λ ) r + p + 1 } C r ( λ ) ( x ) .

Let us take p(x)= C n ( λ ) (x) P n . Then, from (1.1), we have

C n ( λ ) ( x ) = Γ ( λ + 1 2 ) Γ ( n + 2 λ ) Γ ( 2 λ ) Γ ( n + λ + 1 2 ) P n ( λ 1 2 , λ 1 2 ) ( x ) = ( n + 2 λ 1 ) ( 2 λ ) ( n + λ 1 2 ) ( λ + 1 2 ) P n ( λ 1 2 , λ 1 2 ) ( x ) = ( n + 2 λ 1 n ) ( n + λ 1 2 n ) P n ( λ 1 2 , λ 1 2 ) ( x ) .
(2.22)

In the previous paper, we have shown that

P n ( α , β ) (x)= k = 0 n ( n + α n k ) ( n + β k ) ( x 1 2 ) k ( x + 1 2 ) n k (see [14]).
(2.23)

From (2.22) and (2.23), we have

C n ( λ ) (x)= ( n + 2 λ 1 n ) ( n + λ 1 2 n ) k = 0 n ( n + λ 1 2 n k ) ( n + λ 1 2 k ) ( x 1 2 ) k ( x + 1 2 ) n k ,
(2.24)

and

d k d x k C n ( λ ) (x)= 2 k λ k C n k ( λ + k ) (x).
(2.25)

Let p(x)= C n ( λ ) (x)= k = 0 n d k C k ( λ ) (x). Then, by Proposition 2.1, we get

d k = ( k + λ ) Γ ( λ ) ( 2 ) k π Γ ( k + λ + 1 2 ) 1 1 ( d k d x k ( 1 x 2 ) k + λ 1 2 ) C n ( λ ) ( x ) d x = ( k + λ ) Γ ( λ ) ( 2 ) k π Γ ( k + λ + 1 2 ) ( 1 ) k 2 k λ k 1 1 ( 1 x 2 ) k + λ 1 2 C n k ( λ + k ) ( x ) d x = λ k ( k + λ ) Γ ( λ ) π Γ ( k + λ + 1 2 ) 1 1 ( 1 x 2 ) k + λ 1 2 C n k ( λ + k ) ( x ) d x .
(2.26)

By (2.24), we get

C n k ( λ + k ) ( x ) = ( n k + 2 ( λ + k ) 1 n k ) ( n k + λ + k 1 2 n k ) l = 0 n k ( n k + λ + k 1 2 n k l ) ( n k + λ + k 1 2 l ) ( x 1 2 ) l ( x + 1 2 ) n k l = ( n + k + 2 λ 1 n k ) ( n + λ 1 2 n k ) l = 0 n k ( n + λ 1 2 n k l ) ( n + λ 1 2 l ) ( x 1 2 ) l ( x + 1 2 ) n k l .
(2.27)

From (2.26) and (2.27), we have

d k = λ k ( k + λ ) Γ ( λ ) π Γ ( k + λ + 1 2 ) × ( n + k + 2 λ 1 n k ) ( n + λ 1 2 n k ) l = 0 n k ( n + λ 1 2 n k l ) ( n + λ 1 2 l ) ( 1 ) l ( 1 2 ) n k × 1 1 ( 1 x ) k + λ 1 2 + l ( 1 + x ) λ + n 1 2 l d x .
(2.28)

It is easy to show that

1 1 ( 1 x ) k + λ 1 2 + l ( 1 + x ) λ + n l 1 2 d x = 0 1 ( 2 2 y ) k + λ 1 2 + l ( 2 y ) λ + n l 1 2 2 d y = 2 n + 2 λ + k 0 1 ( 1 y ) k + λ + l 1 2 y λ + n l 1 2 d y = 2 k + n + 2 λ Γ ( k + λ + l + 1 2 ) Γ ( λ + n l + 1 2 ) Γ ( k + n + 2 λ ) .
(2.29)

By the fundamental theorem of gamma function, we see that

Γ ( k + λ + l + 1 2 ) = ( k + λ + l 1 2 l ) l!Γ ( k + λ + 1 2 ) ,
(2.30)
Γ ( λ + n l + 1 2 ) = ( λ + n l 1 2 n l ) (nl)!Γ ( λ + 1 2 ) ,
(2.31)

and

Γ(k+2λ+n)= ( k + 2 λ + n 1 n + k ) (n+k)!Γ(2λ).
(2.32)

As is well known, the duplication formula for the gamma function is given by

Γ(z)Γ ( z + 1 2 ) = 2 1 2 z π Γ(2z).
(2.33)

By (2.29), (2.30), (2.31), and (2.32), we get

1 1 ( 1 x ) k + λ + l 1 2 ( 1 + x ) λ + n l 1 2 dx= 2 k + n + 1 ( k + λ + l 1 2 l ) ( λ + n l 1 2 n l ) Γ ( k + λ + 1 2 ) ( n l ) ( k + 2 λ + n 1 n + k ) ( n + k k ) k ! Γ ( λ ) π .
(2.34)

From (2.28) and (2.34), we have

d k = λ k ( k + λ ) 2 2 k + 1 ( n + k + 2 λ 1 n k ) ( n + λ 1 2 n k ) × l = 0 n k ( n + λ 1 2 n k l ) ( n + λ 1 2 l ) ( 1 ) l ( k + λ + l 1 2 l ) ( λ + n l 1 2 n l ) ( n l ) ( k + 2 λ + n 1 n + k ) ( n + k k ) k ! .
(2.35)

Therefore, by (2.35), we obtain the following theorem.

Theorem 2.4 Forn Z + , we have

C n ( λ ) ( x ) = k = 0 n { λ k ( k + λ ) 2 2 k + 1 ( n + k + 2 λ 1 n k ) ( n + λ 1 2 n k ) × l = 0 n k ( n + λ 1 2 n k l ) ( n + λ 1 2 l ) ( 1 ) l ( k + λ + l 1 2 l ) ( n l ) ( k + 2 λ + n 1 n + k ) ( n + k k ) k ! ( λ + n l 1 2 n l ) } C k ( λ ) ( x ) .