Various applications of the (exponential) complete Bell polynomials

Donal F. Connon
16 January 2010
Abstract
In a rather straightforward manner, we develop the well-known formula for the Stirling
numbers of the first kind in terms of the (exponential) complete Bell polynomials where
the arguments include the generalised harmonic numbers.
We also show how the (exponential) complete Bell polynomials feature in a number of
other areas of mathematical interest.
EXPLICIT FORMULA FOR THE STIRLING NUMBERS OF THE FIRST KIND
The Stirling numbers s (n, k ) of the first kind [23, p.56] are defined by the following
n
generating function (the bracket symbol is also employed)
k

(1.1)

x( x 1) ( x n + 1) = s (n, k ) x k
k =0

which we may also express as the infinite series

(1.2)

x( x 1) ( x n + 1) = s (n, k ) x k
k =0

where we define s (n, k ) = 0 for k n + 1 .

Letting x x in (1.2) results in
(1.3)

k =0

k =1

x( x + 1)...( x + n 1) = (1) n + k s (n, k ) x k = (1) n + k s (n, k ) x k

We also consider the ascending factorial symbol ( x ) n , also known as the Pochhamer
symbol, defined by [23, p.16] as
(1.4)

( x) n = x( x + 1)( x + 2) ( x + n 1) if n > 0
( x)0 = 1

The gamma function satisfies the well known recurrence relation

x ( x) = (1 + x)

and it is easily proved by induction that this may be extended to

(1.4.1)

x( x + 1)( x + 2) ( x + n 1) ( x) = (n + x)

Hence we have
(1.5)

( x) n =

(n + x) x ( n + x)
=
( x)
(1 + x)

For the reasons discussed below, we shall find it more convenient to deal with the
function ( x) n divided by x . We consider the first derivative
(1.6)

d ( x) n (n + x)
=
[ (n + x) (1 + x)]
dx x
(1 + x)

where ( x) is the digamma function defined by

(1.6.1)

( x) =

d
log ( x)
dx

By definition we have

(n + x) (1 + x) =

d
d
log (n + x) log (1 + x)
dx
dx

d
( n + x)
log
dx
(1 + x)

( x)
d
log n
dx
x

d
1
log( x) n
dx
x

Referring to the definition (1.4) of the Pochhamer symbol, we have

log( x) n = log x + log( x + 1) + + log( x + n 1)
and differentiation results in

( x)n 1
1
1
= +
+ +
= H n(1) ( x)
( x)n x x + 1
x + n 1
where H n( m ) ( x) is the generalised harmonic number function defined by

(1.7)

n 1

1
m
k =0 (k + x)

H n( m ) ( x) =

and we note that

H

(m)
n

(1) = H

(m)
n

1
m
k =1 k
n

Therefore we have the well known formula [23, p.14]

(n + x) (1 + x) = H n(1) ( x)

1
x

n 1

1
k =1 k + x

=
n 1

1
.
k =1 k + x

and we denote g ( x) =

This gives us the relationship (which in turn leads us to consider the (exponential)
complete Bell polynomials)
d ( x)n ( x)n
=
[ (n + x) (1 + x)]
dx x
x
(1.8)

( x) n
g ( x)
x

We see that
g (0) = H n(1)1
n 1

1
r +1
k =1 ( k + x )

g ( r ) ( x) = (1) r r !

g ( r ) (0) = (1) r r ! H n( r+11)

As noted by Klbig [14] and Coffey [4] we have
3

(1.9)

d r f ( x)
e
= e f ( x )Yr ( f (1) ( x), f (2) ( x),..., f ( r ) ( x) )
r
dx

where the (exponential) complete Bell polynomials may be defined by Y0 = 1 and for
r 1
k1
k2
kr
r!
x1 x2
xr
Yr ( x1 ,..., xr ) =
(1.10)
...
r!
( r ) k1 ! k 2 !... k r ! 1! 2!
where the sum is taken over all partitions (r ) of r , i.e. over all sets of integers k j such
that

k1 + 2k2 + 3k3 + + rkr = r

The definition (1.10) immediately implies the following relation
(1.10.1)

Yr (ax1 , a 2 x2 ,..., a r xr ) = a rYr ( x1 ,..., xr )

and with a = 1 we have

(1.10.2)

Yr ( x1 , x2 ,..., (1) r xr ) = (1) r Yr ( x1 ,..., xr )

The complete Bell polynomials have integer coefficients and the first six are set out
below (Comtet [6, p.307])
(1.11)

Y1 ( x1 ) = x1
Y2 ( x1 , x2 ) = x12 + x2
Y3 ( x1 , x2 , x3 ) = x13 + 3x1 x2 + x3
Y4 ( x1 , x2 , x3 , x4 ) = x14 + 6 x12 x2 + 4 x1 x3 + 3x22 + x4
Y5 ( x1 , x2 , x3 , x4 , x5 ) = x15 + 10 x13 x2 + 10 x12 x3 + 15 x1 x22 + 5 x1 x4 + 10 x2 x3 + x5
Y6 ( x1 , x2 , x3 , x4 , x5 , x6 ) = x16 + 6 x1 x5 + 15 x2 x4 + 10 x23 + 15 x12 x4 + 15 x23 + 60 x1 x2 x3

+20 x13 x3 + 45 x12 x22 + 15 x14 x1 + x6

The complete Bell polynomials are also given by the exponential generating function
(Comtet [6, p.134])


tj
tn
exp x j = Yn ( x1 ,..., xn )
n!
j =1 j ! n =0

(1.12)

Using (1.9) we see that

dn
tj
exp
x
j = Yn ( x1 ,..., xn )
dt n
j =1 j ! t =0

and hence we note that (1.12) is simply the corresponding Maclaurin series.
We note that



tn
tj
tj
t j
Y
ax
ax
ax
a
x
x
(
,...,
)
exp
exp
exp
=
=
=

j j!
j
j
1
n
n
n!
n =0
j =1

j =1 j !
j =1 j !

and thus we have

a

tn
tn
Y
x
x
Y
ax
ax
(
,...,
)
(
,...,
)
=
n
n
n 1
n 1
n !
n!
n =0
n =0

Let us now consider a function f (t ) which has a Taylor series expansion around x : we
have


tj
tj
e f ( x +t ) = exp f ( j ) ( x) = e f ( x ) exp f ( j ) ( x)
j!
j!
j =0
j =1

tn
= e f ( x ) 1 + Yn ( f (1) ( x), f (2) ( x),..., f ( n ) ( x) )
n !
n =1

We see that
d m f ( x ) m f ( x +t )
m f ( x +t )
e
= me
= me
dx m
x
t
t =0
t =0

and we therefore obtain a derivation of (1.9) above

d r f ( x)
= e f ( x )Yr ( f (1) ( x), f (2) ( x),..., f ( r ) ( x) )
e
r
dx
Suppose that h( x) = h( x) g ( x) and let f ( x) = log h( x) . We see that

f ( x) =

h( x)
= g ( x)
h( x )

and then using (1.9) above we have

(1.13)

dr
d r log h ( x )
(
)
=
= h( x)Yr ( g ( x), g (1) ( x),..., g ( r 1) ( x) )
h
x
e
r
r
dx
dx

In particular we have
dr
h( x) = h(0)Yr ( g (0), g (1) (0),..., g ( r 1) (0) )
r
dx
x =0

In our case, from (1.8) we have

h( x ) =

( x)n
x
n 1

1
k =1 k + x

g ( x) =
and it is easily seen that
(1.15)

d r ( x) n
dx r x

r 1
( r 1)! H n( r1) )
= (n 1)!Yr ( H n(1)1 , 1! H n(2)
1 ,..., ( 1)
x =0

Differentiation of (1.3) also results in

(1.16)

d r ( x)n
=
(1) n + k (k 1) (k r ) s (n, k ) x k 1 r

r
dx x
k =0

and in particular we have

(1.17)

d r ( x)n
dx r x

= (1) n + r +1 r ! s (n, r + 1)
x=0

Therefore, equating (1.15) and (1.17), we obtain the known relationship for Stirling
numbers of the first kind for r 0
(1.18)

s (n, r + 1) = (1) n + r +1

(n 1)!
r 1
(r 1)! H n( r)1 )
Yr ( H n(1)1 , 1! H n(2)
1 ,..., ( 1)
r!

The above relationship was previously derived by Klbig [14] but this appears to be a
more direct proof of this important formula.
The first few Stirling numbers s (n, k ) of the first kind are easily determined from (1.18);
these are also reported in [21] and in the book by Srivastava and Choi [23, p.57]
(1.19)

s (n, 0) = n ,0
s (n,1) = (1) n +1 (n 1)!
s (n, 2) = (1) n (n 1)! H n(1)1
s (n,3) = (1) n +1

s (n, 4) = (1) n

{(

(n 1)!
H n(1)1
2

{(

H n(2)
1

3
(n 1)!
(3)
H n(1)1 3H n(1)1 H n(2)
1 + 2 H n1
6

Using (1.18) gives us

(1) n + r k +1

(r k )!
r k 1
(r k 1)! H n( r1 k ) )
s(n, r k + 1) = Yr k ( H n(1)1 , 1! H n(2)
1 ,..., ( 1)
(n 1)!

and since [5, p.415]

(1.20)

r
r
Yr +1 ( x1 ,..., xr +1 ) = Yr k ( x1 ,..., xr k ) xk +1
k =0 k

we obtain the recurrence formula given by Shen [21]

r

(r + 1) s (n, r + 2) = s (n, r k + 1)H n( k1+1)

k =0

Let us now see why we initially directed our attention to ( x) n divided by x .

Differentiation of (1.5) results in
(1.21)

dr
d r ( n + x)
x
(
)
=
= (1) n + k k (k 1) (k r + 1) s (n, k ) x k r
n
r
r
dx
dx ( x)
k =0

and in particular we have

(1.22)

dr
( x) n
dx r

= (1) n + r r ! s (n, r )
x =0

Alternatively we have the first derivative

d
d (n + x) ( x)(n + x) ( x)(n + x)
( x) n =
=
dx
dx ( x)
2 ( x)

( n + x)
[ (n + x) ( x)]
( x )

Therefore we have
(1.23)

( x) n
d
( x) n = ( x) n H n(1) ( x) =
x H n(1) ( x)
dx
x

and it is easily seen from (1.7) that

lim x H n(1) ( x) = 1
x 0

Hence we obtain
d
( x)n
dx

= (n 1)!
x =0

and using (1.19) we see again that

s (n,1) = (1) n +1 (n 1)!

It should be noted that

dr
( x)n
dx r

may also be determined directly; however, the

x =0

d2
mathematics is somewhat more cumbersome. For example, let us consider 2 ( x) n
dx

Differentiating (1.23) gives us

2
d2
( x) n = ( x) n H n(1) ( x) H n(2) ( x)
2
dx

We have by definition

.
x =0

H n(1) ( x + 1) =

1
1
1
+
+ +
x +1 x + 2
x+n

and therefore

H n(1) ( x) =

1
1
1
1
1
+
+ +
=
+ H n(1) ( x + 1)
x x +1
x + n 1 x x + n

n
+ H n(1) ( x + 1)
x ( x + n)

This gives us
2
n2
2n
(1)
H ( x) = 2

+
H
(
x
+
1)
+
H n(1) ( x + 1)
n
2

x ( x + n)
x( x + n)
2

(1)
n

Similarly we have

H n(2) ( x) =

1
1

+ H n(2) ( x + 1)
2
2
x ( x + n)
2nx + n 2
+ H n(2) ( x + 1)
2
2
x ( x + n)

and we easily see that

2
2
2n
2nx
H n(1) ( x) H n(2) ( x) = H n(1) ( x + 1) H n(2) ( x + 1) +
H n(1) ( x + 1) 2
x ( x + n)
x ( x + n) 2

This gives us

lim x H n(1) ( x) H n(2) ( x) = 2 H n(1)1

x 0
and we then obtain
d2
( x) n
dx 2

x =0

= lim( x) n H n(1) ( x) H n(2) ( x)

x 0

2
( x)n
x H n(1) ( x) H n(2) ( x)
x 0
x

= lim

= 2(n 1)! H n(1)1

Hence we have using (1.22)
s (n, 2) = (1) n (n 1)! H n(1)1

From (1.23) we find that

dr
( x) n = ( x) n Yr ( H n(1) ( x), 1! H n(2) ( x),..., (1) r 1 (r 1)! H n( r ) ( x) )
r
dx
and using (1.21) we see that
(1) n + r r ! s (n, r ) = lim( x) n Yr ( H n(1) ( x), 1! H n(2) ( x),..., (1) r 1 (r 1)! H n( r ) ( x) )
x 0

CAUCHYS GENERATING FUNCTION FOR THE STIRLING NUMBERS

OF THE FIRST KIND
Using the binomial theorem we have for z < 1

( x)n n
1
=
z

x
(1 z )
n =0 n !

(2.1)

and, using (1.22), differentiation with respect to x results in

log(1 z ) ( x) n H n(1) ( x) n
z

=
n!
(1 z ) x
n =0

(2.2)

More generally we have

(1) r

log r (1 z ) d r
zn
x
=
(
)

n
r
(1 z ) x
n!
n = 0 dx

and letting x = 0 we see that

dr
( x)n
r
n = 0 dx

(1) r log r (1 z ) =

x =0

zn
n!

Then using (1.22)

10

dr
( x)n
dx r

= (1) n + r r ! s ( n, r )
x =0

we then easily obtain the well-known Maclaurin expansion due to Cauchy [23, p.56]
(2.3)

log r (1 z ) = r ! (1) n s (n, r )

n =0

zn
n!

Since s (n, r ) = 0 for r n + 1 this may be expressed as

log r (1 z ) = r ! (1) n s (n, r )

n=r

zn
n!

A different proof of (2.3) was given by Pyla and Szeg in [18, p.227].
Letting x = 1 in (2.2) we obtain the well-known generating function for the harmonic
numbers
(2.3.1)

log(1 z ) (1) n
= Hn z
1 z
n =0

Differentiating (2.2) gives us

log (1 z )
=
(1 z ) x
n =0

(2.4)

( x) n H n(1) ( x) H n(2) ( x)
n!

)z

and with x = 1 we have

(2.5)

2
log 2 (1 z )
= H n(1) H n(2) z n
1 z
n =0

Such series are considered in more detail in, for example, [7] and the references
contained therein.
Integrating (2.5) results in

1 3
z n +1
(1) 2
(2 )

log (1 z ) = H n H n
3
n +1
n =0
2
(1)
1
1 z n +1
(2)
= H n +1
H n +1 +

n + 1
(n + 1) 2 n + 1
n =0

11

2 H n(1)+1
2 z n +1
= H n(1)+1
H n(2)
+

+1
n +1
(n + 1) 2 n + 1
n =0

2 H n(1)
2 zn
= H n(1)
H n(2) + 2
n
n n
n =1

We therefore have
(2.6)

H n(1) n
zn
1 3
(1) 2
(2)

log (1 z ) = H n H n
2 2 z + 2 Li3 ( z )
3
n
n =1
n =1 n

where Li3 ( z ) is the polylogarithm defined by

zn
Lis ( z ) = s
n =1 n

(2.7)

From (2.3) we have with r = 3

log 3 (1 z ) = 6 (1) n s (n,3)

n =0

zn
n!

2
zn
= 3 H n(1)1 H n(2)
1
n
n =1

(1) 2 2 H n(1)
2 zn
(2)

= 3 H n
Hn + 2
n
n n
n =1

in agreement with (2.6) above.

COPPOS FORMULA
We have the well-known partial fraction decomposition [13, p.188]
(3.1)

f ( x) =

n
n (1) k
n!
=
x( x + 1)...( x + n) k =0 k k + x

n + x
=x

n
1

, x {0, 1,..., n}

12

and we note from (1.4.1) that

n!
(n + 1)( x)
=
x(1 + x)...(n + x) (n + 1 + x)
or equivalently

n!
(n + 1)
=
x(1 + x)...(n + x)
( x) n +1

Differentiation results in
f ( x) =

(n + 1) (1)
H n +1 ( x)
( x) n +1

and referring to (1.13) we therefore have the r th derivative

f ( r ) ( x) =

(n + 1)
r
(r )
Yr ( H n(1)+1 ( x),1! H n(2)
+1 ( x ),..., ( 1) ( r 1)! H n +1 ( x ) )
( x) n +1

We also have from (3.1)

n
n (1) k
f ( r ) ( x) = (1) r r !
r +1
k =0 k (k + x)

and we therefore obtain

(3.2)

n (1) k
(n + 1) (1) r
r
(r )
=
Yr ( 0! H n(1)+1 ( x),1! H n(2)

+1 ( x ),..., ( 1) ( r 1)! H n +1 ( x ) )

r +1
( x) n +1 r !
k = 0 k (k + x)
n

It may be noted that Coppo [10] has expressed this in a slightly different form
(3.3)

n (1) k
(n + 1) 1
(r )
=
Yr ( 0! H n(1)+1 ( x),1! H n(2)

+1 ( x ),..., ( r 1)! H n +1 ( x ) )

r +1
( x) n +1 r !
k =0 k (k + x)
n

and reference to (1.10.2) shows that these are equivalent statements. It may be noted that
n
n (1) k
reference to the right-hand side of (3.3) shows that
is positive for x > 0
r +1
k =0 k (k + x)
(which otherwise does not appear to be immediately obvious).
Particular cases of Coppos formula are set out below.

13

(3.4)

n (1) k

k ( k + x) =
k =0

(n + 1)( x)
(n + 1)( x)
Y0 =
(n + 1 + x)
( n + 1 + x)

n (1) k
(n + 1)( x)
( n + 1)( x) (1)
=
Y1 H n(1)+1 ( x) =
H n +1 ( x)

2
( n + 1 + x)
( n + 1 + x)
k =0 k (k + x)

(3.5)

n (1) k
(n + 1)( x) 1
=
Y2 H n(1)+1 ( x), H n(2)

+1 ( x )
3
(n + 1 + x) 2
k =0 k (k + x)

2
(n + 1)( x) 1
H n(1)+1 ( x) + H n(2)
+1 ( x )
( n + 1 + x) 2

(3.6)
n

n (1) k

k ( k + x)
k =0

(3.7)

(n + 1)( x) 1
(3)
Y3 H n(1)+1 ( x), H n(2)
+1 ( x ), 2 H n +1 ( x )
(n + 1 + x) 6

3
(n + 1)( x) 1
(3)
H n(1)+1 ( x) + 3H n(1)+1 ( x) H n(2)
+1 ( x ) + 2 H n +1 ( x )
( n + 1 + x) 6

n (1) k
We now wish to consider representations for r . We see that
k =1 k k
n

n
n (1) k
n (1) k 1 (n + 1)( x) 1

=
=

x (n + 1 + x) x
k =1 k k + x
k =0 k k + x
n

(n + 1) x( x) (n + 1 + x)
x(n + 1 + x)

(n + 1)(1 + x) (n + 1 + x)
x(n + 1 + x)

and we have the limit as x 0

n (1) k
(n + 1) x( x) (n + 1 + x) 0
= lim

x 0
0
k
x(n + 1 + x)
k =1 k
n

Applying LHpitals rule we obtain

14

(n + 1)(1 + x) (n + 1 + x)
x0
x(n + 1 + x) + (n + 1 + x)

= lim

(n + 1)(1) (n + 1)
(n + 1)

= (1) (n + 1)
= H n(1)
Hence we obtain Eulers well-known identity
n (1) k

= H n(1)
k
k =1 k
n

(3.8)

Similarly we also have

n (1) k
1
(n + 1)( x) (1)
=
H n +1 ( x) 2

2
x
(n + 1 + x)
k =1 k ( k + x )
n

(n + 1) x 2 ( x) H n(1)+1 ( x) (n + 1 + x)
x 2 (n + 1 + x)

(n + 1) (1 + x) x H n(1)+1 ( x) (n + 1 + x)
=
x 2 (n + 1 + x)

and since lim x H n(1) ( x) = 1 we see that we may apply LHpitals rule to obtain
x 0

n (1) k

2
k =1 k k
n

(1)

(n + 1)(1 + x)[ H n(1)+1 ( x) x H n(2)

+1 ( x )] + ( n + 1) (1 + x ) x H n +1 ( x ) ( n + 1 + x )
= lim
x0
x 2 (n + 1 + x) + 2 x( n + 1 + x)

(1)
Since lim[ H n(1)+1 ( x) x H n(2)
we have
+1 ( x )] = H n
x 0

(n + 1) H n(1) + (n + 1)(1) (n + 1)
0

15

(n + 1) H n(1) + (1) (n + 1)
0
0
0

Hence we may apply LHpitals rule again to obtain

(3)
(n + 1)(1 + x)[2 H n(2)
+1 ( x ) + 2 x H n +1 ( x )]
x 2 (n + 1 + x) + 2 x(n + 1 + x) + 2 x(n + 1 + x) + 2(n + 1 + x)

= lim
x 0

2(n + 1)(1 + x)[ H n(1)+1 ( x) x H n(2)

+1 ( x )]
+ lim 2
x 0 x ( n + 1 + x ) + 2 x( n + 1 + x ) + 2 x( n + 1 + x ) + 2 ( n + 1 + x )
(n + 1)(1 + x) x H n(1)+1 ( x)
+ lim 2
x 0 x ( n + 1 + x ) + 2 x( n + 1 + x ) + 2 x( n + 1 + x ) + 2 ( n + 1 + x )

lim
x 0

(n + 1 + x)
x (n + 1 + x) + 2 x(n + 1 + x) + 2 x(n + 1 + x) + 2(n + 1 + x)
2

1
1
(n + 1)
= [2 H n(2) + 2(1) H n(1) ] (1)
=L
2
2
(n + 1)
Differentiation of (1.6.1) gives us

( x) =
so that

( x)( x) ( ( x) )
2 ( x)

= (2, x)

( x)
= 2 ( x) + (2, x)
( x)

where ( s, x) is the Hurwitz zeta function.

Therefore we have
(n + 1)
= 2 (n + 1) + (2, n + 1)
(n + 1)
(1) = 2 (1) + (2)
and so
16

(1)

(n + 1)
= (2) (2, n + 1) + 2 (1) 2 (n + 1)
(n + 1)

From the definition of the Hurwitz zeta function it readily follows that

( s, n + x) = ( s, x) H n( s ) ( x)
and in particular we have

(2) (2, n + 1) = H n(2)

Since (n + 1) (1) = H n(1) we have

2 (n + 1) + 2 (1) 2 (1) (n + 1) = H n(1)

Therefore we obtain
(1)
and thus
L=

2
(n + 1)
= H n(2) H n(1) + 2 2 (1) 2 (1) (n + 1)
(n + 1)

2
1
H n(2) H n(1) + 2 2 (1) 2 (1) (n + 1) + 2 (1) H n(1)
2

which simplifies to
L=

2
1
H n(2) + H n(1)
2

so that we obtain

2
n (1) k
1
= H n(2) + H n(1)
2
2
k =1 k
n

(3.9)

The above result is well known; see for example the paper by Flajolet and Sedgewick
[12] where they also reported the following identity
n (1) k 1 (1)
S n (3) = 3 = H n
6
k =1 k k
n

1
1
+ H n(1) H n(2) + H n(3)
2
3

which may also be derived by the above limiting process (albeit with much more tedious
labour).

17

Defining S n (r ) by
n (1) k
S n (r ) = r
k =1 k k
n

(3.10)

then Flajolet and Sedgewick [12] showed that S n (r ) can be expressed in terms of the
generalised harmonic numbers as
(3.11) Sn (r ) =

m1

1m1 + 2 m2 + 3 m3 ...= r

m2

m3

H n(1) H n(2) H n(3)

H n( r )
1

m1 ! m2 ! m3 !...mr ! 1 2 3
r

mr

Referring to (1.10) we then note that this may be written as

Sn (r ) =

1
Yr 0! H n(1) ,1! H n(2) ,..., (r 1)! H n( r )
r!

and hence we have

n
n (1) k
1
S n (r ) = r = Yr ( 0! H n(1) ,1! H n(2) ,..., (r 1)! H n( r ) )
r!
k =1 k k

(3.12)

which may be contrasted with (3.2).

Rather belatedly, I noted that letting x 1 + x in (3.2) gives us
n
(1) k
(n + 1) (1) r
r
(r )
=
Yr ( 0! H n(1)+1 (1 + x),1! H n(2)

+1 (1 + x ),..., ( 1) ( r 1)! H n +1 (1 + x ) )

r +1
(1 + x) n +1 r !
k =0 k (k + 1 + x)
n

whereupon letting x = 0 results in

n (1) k
1 (1) r
(r )
r
=
Yr ( 0! H n(1)+1 ,1! H n(2)

+1 ,..., ( 1) ( r 1)! H n +1 )

r +1
n +1 r !
k = 0 k ( k + 1)
n

With n n 1 this becomes

n 1 (1) k
1 (1) r
=
Yr ( 0! H n(1) ,1! H n(2) ,..., (1) r (r 1)! H n( r ) )

r +1
n r!
k = 0 k ( k + 1)
n 1

Reindexing gives us

18

 n 1 (1) m+1 1 (1) r

Yr ( 0! H n(1) ,1! H n(2) ,..., ( 1) r (r 1)! H n( r ) )
=

r +1
n r!
m =1 m 1 m
n

Since

(3.13)

1 n 1 1 n

= this becomes
m m 1 n m
n (1) m +1 (1) r
Yr ( 0! H n(1) ,1! H n(2) ,..., (1) r (r 1)! H n( r ) )
=
r
!
m
r
m =1

and having regard to (1.10.2) we see that

(3.14) Yr ( 0! H n(1) ,1! H n(2) ,..., (r 1)! H n( r ) ) = (1) r Yr ( 0! H n(1) ,1! H n(2) ,..., (1) r (r 1)! H n( r ) )

Hence we obtain as before

(3.15)

n (1) m +1 1
= Yr ( 0! H n(1) ,1! H n(2) ,..., (r 1)! H n( r ) )

r
m
r!
m =1 m
n

We now multiply (3.12) by x r and make the summation to obtain

(3.16)

r
n (1) k +1
(1)
(2)
(r ) x
= Yr ( 0! H n ,1! H n ,..., (r 1)! H n )
x

kr
r!
r =0
k =1 k
r =0

and comparing this with (1.12) we have

(3.17)

n
H n( r ) r
n (1) k +1
r
=
exp
x
x

kr
r =0
k =1 k
r =1 r

Let

f ( x) = log (n + x) log (1 + x)
Then we have
f ( m ) (0) = ( m 1) (n) ( m 1) (1) = (1) m +1 (m 1)! H n( m1)
and we therefore have the Maclaurin expansion
(3.17)

(1) m +1 ( m ) m
H n 1 x
m
m =1

f ( x) = log (n + x) log (1 + x) = log (n) +

19

This may be written as

(3.18)

(1) m +1 ( m ) m
(n + x)
= exp
H n 1 x
(1 + x)(n)
m =1 m

as previously noted by Wilf [24]. We also note that

(1) m ( m ) m
(1 + x)(n)
= exp
H n 1 x
(n + x)
m =1 m

With x x and n n + 1 (3.18) becomes

H n( m ) m
(n + 1 x)
= exp
x
(1 x)(n + 1)
m =1 m

and therefore we have

H n( m ) m
(1 x)(n + 1)
= exp
x
( n + 1 x)
m =1 m

Hence we obtain
(3.19)

(1 x)(n + 1) r n n (1) k +1
= x
(n + 1 x)
kr
r =0
k =1 k

From (3.16) we have

(1) m +1 ( m ) m
H n 1 x
m
m =1

log (n + x) log (1 + x) = log (n) +

With x x and n n + 1 this becomes

(1 x)(n + 1) H n( m ) m
=
log
x
(n + 1 x)
m =1 m

Therefore using (6.3) we have

(1 x)(n + 1)
xm
= Ym H n(1) ,1! H n(2) ,..., (m 1)! H n( m )
(n + 1 x)
m!
m =0

Employing (1.12) we see that

20

Ym H n(1) ,1! H n(2) ,..., (m 1)! H n( m )

m =0

(m)
n

) mx ! = exp Hm
m =1

xm

and hence we have

(3.20)

(1 x)(n + 1) r n n (1) k +1
= x
(n + 1 x)
kr
r =0
k =1 k

Using (1.12) and (3.2) gives us a more general identity

tr
r =0

(1) r ( x) n +1 n n (1) k
tr
(1)
(2)
(r )
r
0!
(
),1!
(
),...,
(
1)
(
1)!
(
)
=

Y
H
x
H
x
r
H
x
(
)

r
n +1
n +1
n +1
(n + 1) k =0 k (k + x) r +1 r =0
r!

(r )

r H n +1 ( x ) r
= exp (1)
t
r
r =1

In equation (3.67a) of [7] we showed that

n
n (1) k +1
1
t
n
=
t
Lir

r
k
t 1 1 t
n =1
k =1 k

(3.21)

and using (3.12) we see that

1
t 1
(1)
(2)
(r )
n
Lir
= Yr 0! H n ,1! H n ,..., (r 1)! H n t
t 1 1 t r ! n =1

(3.22)

where Lir ( x) is the polylogarithm function defined by

xk
r
k =1 k

Lir ( x) =

We note that
(1) k
Lir (1) = r = s (r )
k =1 k

where s (r ) is the alternating Riemann zeta function and

s (r ) = (1 21 r ) (r )
Therefore with t = 1/ 2 in (3.22) we obtain
21

1 1
2 Lir ( 1) = n Yr 0! H n(1) ,1! H n(2) ,..., (r 1)! H n( r )
r ! n =1 2

and thus we obtain

(3.23)

(r ) =

1
1
Y 0! H n(1) ,1! H n(2) ,..., (r 1)! H n( r )

n +1 r
1 r
(1 2 )r ! n =1 2

SOME CONNECTIONS WITH THE BETA FUNCTION

Eulers beta function is defined for Re ( x) > 0 and Re ( y ) > 0 by the integral
1

B ( x, y ) = t x 1 (1 t ) y 1 dt
0

and it is well known that

B ( x, y ) =

( x ) ( y )
( x + y )

Differentiating with respect to x gives us

1

( x ) ( y )
[ ( x) ( x + y )] = t x 1 (1 t ) y 1 log t dt
B ( x, y ) =
x
( x + y )
0

and with y = n we have

1

(4.1)

( x ) ( n)
[ ( x) ( x + n)]
( x + n)

x 1

(1 t ) n 1 log t dt =

x 1

(1 t ) n 1 log t dt =

or equivalently
1

(4.2)

t
0

( x)(n) (1)
H n ( x)
( x + n)

With x = 1 we obtain the well known integral representation for the harmonic numbers
1

(4.3)

n (1 t ) n 1 log t dt = H n(1)
0

22

More generally we have

1

(4.4)

x 1

(1 t ) n 1 log r t dt =

( x ) ( n)
Yr 0! H n(1) ( x),1! H n(2) ( x),..., (1) r (r 1)! H n( r ) ( x )
( x + n)

and with x = 1 we have

1

(1 t )

(4.5)

n 1

1
log r t dt = Yr 0! H n(1) ,1! H n(2) ,..., (1) r (r 1)! H n( r )
n

which immediately gives us the specific value with r = 2

1

n (1 t ) n 1 log 2 t dt = H n(2) + H n(1)

(4.6)

The following formula was also reported by Devoto and Duke [11, p.30]
1

(1 t )

n 1

2 (2) n 1 H k(1)
log t dt = H n +

n
k =1 k + 1
2

and the equivalence is readily seen by reference to Adamchiks formula [1]

H k(1) 1 (1)
= Hn

2
k =1 k

(4.7)

1
+ H n(2)
2

As a matter of interest, I also found formula (4.7) reported by Levenson in a 1938 volume
of The American Mathematical Monthly [15] in a problem concerning the evaluation of

(4.8)

(1) = e x log 2 x dx = 2 + (2)

0

We also see from (4.5) that

1

3
1
1
1

n (1 t ) n 1 log 3 t dt = 6 H n(1) + H n(1) H n(2) + H n(3)

2
3
6

(4.9)

The following formula was also reported by Devoto and Duke [11, p.30]
1

n (1 t )
0

n 1

(1)
n 1
(3) n 1 H k(1)
H k(2) n 1 1 k 2 H j
log t dt = 6 H n +
+
+

2
k =1 ( k + 1)
k =1 k + 1
k =1 k + 1 j =1 j + 1

23

and its equivalence to (4.9) is readily seen by reference to Adamchiks formula [1]
H k( 2 ) n H k(1)
+ 2 = H n(3) + H n(1) H n( 2 )

k
k =1 k
k =1
n

Comparing (4.5) with (3.13) we immediately see that

1
n
n (1) k
(1) r +1 n (1 t ) n 1 log r t dt = r ! r
k =1 k k
0

(4.10)

which was also derived in equation (4.4.155zi) of [8].

AN APPLICATION OF THE DIGAMMA FUNCTION
We have the classical formula for the digamma function
(5.1)

(1) k +1 x( x 1)...( x k + 1)
k a (a + 1)...(a + k 1)
k =1

( x + a ) ( a ) =

which converges for Re ( x + a ) > 0 . According to Raina and Ladda [19], this summation
formula is due to Nrlund (see [16], [17] and also Rubens note [20]).
Then using
( x) n = x( x + 1) ( x + n 1) =

( x + n)
( x)

we see that we may write

(5.2)

1 ( x)n
n =1 n ( a ) n

( a x ) ( a ) =

Differentiating this with respect to x and using (1.22) we get

1 ( x) n
Yr ( H n(1) ( x), 1! H n(2) ( x),..., (1) r 1 (r 1)! H n( r ) ( x) )
n =1 n ( a ) n

(1) r ( r ) (a x) =

Differentiating (5.2) with respect to a and using

d 1
1
=
H n(1) (a )
da (a) n
(a)n

24

we obtain

1 ( x)n
Yr ( H n(1) (a ),1! H n(2) (a),..., (1) r ( r 1)! H n( r ) ( a ) )
n =1 n ( a ) n

(5.3) ( r ) (a x) ( r ) (a) =

As shown in [7] we may obtain numerous Euler sums by utilising these formulae.
From (4.4) we have
1

1
1
t a 1 (1 t ) n 1 log r t dt =
Yr 0! H n(1) (a),1! H n(2) (a ),..., (1) r (r 1)! H n( r ) (a )

( n) 0
(a) n

and substituting this in (5.3) gives us

( a x )
(r )

(r )

( x) n 1 a 1
(a ) =
t (1 t ) n 1 log r t dt

n =1 n ! 0

Differentiation with respect to x results in

1

( x) n H n(1) ( x) a 1
t (1 t ) n 1 log r t dt

n!
n =1
0

( r +1) (a x) =
and with x = 1 we have

( r +1)

(a 1) = H
n =1

(1)
n

a 1

(1 t ) n 1 log r t dt

t a 1 log r t (1)
=
H n (1 t ) n dt

1 t n =1
0
1

From (2.3.1) we see that

H
n =1

(1)
n

(1 t ) n =

log t
t
t a 2 log r +1 t
dt
1 t
0

( r +1) (a 1) =
We may express this as

25

t a 1 log r t
dt
1 t
0

(a) =
(r )

We note that [23, p.22]

( r ) (a) = (1) r +1 r ! (r + 1, a)
which results in the well-known integral
t a 1 log r t
dt
1 t
0

(1) r r ! (r + 1, a ) =

SOME OTHER APPLICATIONS OF THE COMPLETE BELL POLYNOMIALS

Let us consider the function h( x) with the following Maclaurin expansion

(6.1)

bn n
x
n =1 n

log h( x) = b0 +

and we wish to determine the coefficients an such that

(6.2)

h( x) = ar x r
r =0

By differentiating (6.1) we obtain

h( x) = h( x) bn x n 1 h( x) g ( x)
n =1

From (1.13) we have

dr
d r log h ( x )
(
)
=
= h( x)Yr ( g ( x), g (1) ( x),..., g ( r 1) ( x) )
h
x
e
r
r
dx
dx
and in particular we have
dr
h( x) = h(0)Yr ( g (0), g (1) (0),..., g ( r 1) (0) )
r
dx
x =0

Using (6.2) the Maclaurin series gives us

26

ar =

ar =

1 dr
h( x )
r ! dx r
x =0

1
h(0)Yr g (0), g (1) (0),..., g ( r 1) (0)
r!

We have

g ( j ) ( x) = bn (n 1)(n 2) (n j ) x n 1 j
n =1

and thus
g ( j ) (0) = j !b j +1

Therefore we obtain
ar =
=

1 b0
e Yr g (0), g (1) (0),..., g ( r 1) (0)
r!

1 b0
e Yr ( b1 ,1!b2 ,..., (r 1)!br )
r!

Since log h(0) = log a 0 = b0 we have

(6.3)

h( x) = eb0 Yn ( b1 ,1!b2 ,..., (n 1)!bn )

n =0

Then referring to (1.12)

tj
tn
exp x j = Yn ( x1 ,..., xn )
n!
j =1 j ! n =0

we see that
bj
h( x) = eb0 exp t j
j =1 j

and this is where we started from in (6.1).

bn n
x
n =1 n

log h( x) = b0 +

Multiplying (6.1) by it is easily seen that

27

xn
n!

(6.4)

h ( x) = e b0 Yn ( b1 ,1! b2 ,..., (n 1)! bn )

n =0

xn
n!

and, in particular, with = 1 we obtain

(6.5)

1
xn
= e b0 Yn ( b1 , 1!b2 ,..., (n 1)!bn )
h( x )
n!
n =0

Differentiating (6.4) with respect to would give us an expression for h ( x) log h( x) .

Using (1.20) we find that
r
r
(r + 1)!e b0 ar +1 = (r k )!e b0 ar k k !bk +1
k =0 k

giving us the recurrence relation

r

(r + 1)ar +1 = ar k bk +1
k =0

or equivalently
r

(6.6)

rar = ar mbm
m =1

Suppose that h( x) = h( x) g ( x) and let f ( x) = log h( x) . We see that

f ( x) =

h( x)
= g ( x)
h( x )

and then using (1.9) above we have

dr
d r log h ( x )
(
)
=
= h( x)Yr ( g ( x), g (1) ( x),..., g ( r 1) ( x) )
h
x
e
r
r
dx
dx
Hence we have the Maclaurin expansion

h( x) = h(0) Yr ( g (0), g (1) (0),..., g ( r 1) (0) )

r =0

Reference to (1.12) gives us

28

xr
r!


tj
h( x) = h(0) exp g ( j 1) (0)
j!
j =1

and hence we have

log h( x) = log h(0) + g

( j 1)

j =1

tj
(0)
j!

Therefore, as expected, we obtain

f ( x) = f (0) + f ( j ) (0)
j =1

tj
j!

Gamma function

We note the well known series expansion

( n)

n=2

log (1 + x) = x + (1) n

xn

, 1 < x 1

and hence we have

(6.7)

(1 + x) = Yn 0! (1),1! (2),..., (1) n (n 1)! (n)

n =0

) xn!

and
(6.8)

1
xn
= Yn ( 0! (1), 1! (2),..., (1) n +1 (n 1)! (n) )
n!
(1 + x) n =0

where (1) is defined as equal to .

Differentiating (6.7) we get

( m ) (1 + x) = Yn 0! (1),1! (2),..., (1) n (n 1)! (n)

n =1

) n(n 1)...(nn! m + 1) x

and hence, letting x = 0 , we have the m th derivative of the gamma function

(6.9)

( m ) (1) = Yn 0! (1),1! (2),..., ( 1) m ( m 1)! ( m)

29

nm

where we again designate (1) = .

It is reported as an exercise in Apostols book [2, p.303] that ( n ) (1) has the same sign as
(1) n and a derivation is contained in [9].
An alternative proof is shown below. Since ( x) = ( x) ( x) we have
( m ) ( x) = ( x)Ym ( ( x), (1) ( x),..., ( m 1) ( x) )
and using (3.7)

( p ) ( x) = (1) p +1 p ! ( p + 1, x)
we may express ( m ) ( x) in terms of ( x) and the Hurwitz zeta functions.

( m ) ( x) = ( x)Ym ( ( x),1! (2, x),..., (1) m (m 1)! (m, x) )

From the definition of the (exponential) complete Bell polynomials we have
Ym (ax1 , a 2 x2 ,..., a m xm ) = a mYr ( x1 ,..., xm )
and thus with a = 1 we have
Ym ( x1 , x2 ,..., (1) m xm ) = (1) m Ym ( x1 ,..., xm )
Hence we see that
( m ) ( x) = (1) m ( x)Ym ( ( x),1! (2, x),..., (m 1)! (m, x ) )

It is well known that ( x) is negative in the interval [0, ) where > 0 is the unique
solution of ( ) = 0 and hence we see that ( x) is positive in that interval. Since
Ym ( x1 ,..., xm ) > 0 when all of the arguments are positive, we deduce that ( m ) ( x) has the
same sign as (1) m when x [0, ) .
We also note that
Ym ( x1 , x2 ,..., (1) m +1 xm ) = (1)m Ym ( x1 ,..., xm )
but no discernable sign pattern emerges here. We may note that

30

Yn ( b1 , 1!b2 ,..., (1) n +1 (n 1)!bn ) = (1) n Yn ( b1 , 1!b2 ,..., (n 1)!bn )

= (1) n e b0

dn 1
dx n h( x)

x =0

We also have the expansion [23, p.159]

(1) n (n, a ) n
log (a + x) = log (a ) + (a) x +
x
n
n=2

and hence we deduce that

xn
(a + x) = (a ) Yn ( 0! (a ),1! (2, a ),..., (1) (n 1)! (n, a ) )
n!
n =0
n

Barnes double gamma function

We note the Barnes double gamma function G ( x) defined by [23, p.25]

k
x2

1
x
2
2
G (1 + x) = (2 ) exp ( x + x + x) 1 + exp x
2
k =1 k
2k

x

The following identity was originally derived by Srivastava [23, p.210] in 1988
log G (1 + x) =

1
1
(k 1) k
2
log(2

1
x

(1
+

)
x
+
(1) k +1
x
[
]

2
2
k
k =3

and from this we may determines a series expansion for 1/ G ( x + 1) in terms involving the
exponential Bell polynomials. Using () we have

1
xn
= Yn ( c1 ,1!c2 ,..., (1) n (n 1)!cn )
G (1 + x) n =0
n!

where

c1 =

1
[log(2 ) 1]
2

c2 = (1 + )

cn = (n 1) for n 3

and we note that cn > 0 for all n 1 .

We then see that

31

dm
1
= Ym ( c1 ,1!c2 ,..., (1) m (m 1)!cm )
m
dx G (1 + x) x =0
and noting (1.10.2) we determine that
dm
1
= (1) m Ym ( c1 ,1!c2 ,..., (m 1)!cm )
m
dx G (1 + x) x =0

so that the derivatives have the same sign as (1) m . In fact

dm
1
has the same
m
dx G (1 + x)

sign as (1) m for all x 0 .

For example we have

d
1
G(1 + x)
= 2
= G(1)
dx G (1 + x) x =0
G (1 + x) x =0
and hence we have

G(1) =

1
[log(2 ) 1]
2

Bernoulli numbers

The Bernoulli numbers are defined by the generating function

Bn n
t
=
t

t
e 1 n =0 n !

and thus

Bn n 1
1
t
=

t
e 1 n =0 n !

Integration gives us
dt
e t dt
x
a
=
a et 1 a 1 et = log(1 e ) log(1 e )
x

Bn n
[ x an ]
n
n
!
n =1

= log x log a +
and hence we obtain

32

Bn n
[ x an ]
n =1 n n !

log(1 e ) log(1 e ) = log x log a +

x

We may express this as

log

(1 e x )
(1 e a ) Bn n
= log
+
[ x an ]
x
a
n =1 n n !

Using LHpitals rule we see that

lim log
a 0

(1 e a )
=0
a

and with x x we obtain

n +1
x (1) Bn n
x
log x =
e 1 n =1 n n !

which was proved by Ramanujan for x < 2 [3, p.119].

Hence we have
n

x
B1 B2
n +1 Bn x
,
,...,
(
1)
Y
=

2
e x 1 n=0 1
n n!

and we therefore see that

n
Bn n B1 B2
n +1 Bn x
x
Y
,
,...,
(
1)
=

2
n n!
1
n =0 n !
n =0

Equating coefficients gives us the recurrence relation

(6.10)

B
B
B
Bn = Yn 1 , 2 ,..., (1) n +1 n
2
n
1

Employing (1.20) we obtain

(6.11)

r
r B B
Br +1 = (1) k r k k +1
k =0
k k +1

Values of the Riemann zeta function (2n)

33

This section is based on a paper by Snowden [22]. We have the well-known infinite
product

x2
sin x = x 1 2
k
k =1
and we have for x < 1

x2
(2n) 2 n
sin x
x
=

log
log
1

2
n
x k =1
n =1
k

bn n
x
n =1 n

= 2

where b2 n = 2 (2n) , b2 n +1 = 0 .
Therefore we have
sin x
xn
= Yn ( b1 , 1!b2 ,..., (n 1)!bn )
n!
x
n=0

We also have the Maclaurin series

sin x
x2n
= (1) n 2 n
x
(2n + 1)!
n=0

and equating coefficients gives us

(1) n (2n)! 2 n
= Y2 n ( b1 , 1!b2 ,..., (2n 1)!b2 n )
(2n + 1)!
0 = Y2 n +1 ( b1 , 1!b2 ,..., (2n)!b2 n +1 )

For example, with n = 1 we obtain Eulers formula

2
3

= Y2 ( 0, 2 (2) ) or (2) =

2
6

and with n = 2 we have

4
60

= 2 (2) (4)

34

We obtain from (1.20)

2 n 1 2n 1

Y2 n =
Y2 n 1 k xk +1
k
k =0
n
n
2n 1
2n 1
Y
x
=
+
2 n 1 2 k 2 k +1
Y2 n 2 k x2 k
k = 0 2k
k =1 2k 1

and, because b2 n +1 = 0 , we have in our specific case

n
2n 1
Y2 n =
Y2 n 2 k x2 k
k =1 2k 1

This results in
n
2n 1 (1) n k (2n 2k )! 2 n 2 k (2k 1)! (2k )
(1) n (2n)! 2 n
= 2

(2n + 1)!
(2n 2k + 1)!
k =1 2k 1

which simplifies to
n
(2n)!
(1) k +1 2 k (2k )
= 2
(2n 1)!(2n + 1)!
(2n 2k + 1)!
k =1

Then substituting the well known relation [23, p.98]

(2k ) =

(1) k +1 22 k 2 k B2 k
2(2k )!

we obtain
n
22 k B2 k
(2n)!
=
(2n 1)!(2n + 1)! k =1 (2n 2k + 1)!(2k )!

or equivalently
n
2n 22 k B2 k
[(2n)!]2
=
(2n 1)!(2n + 1)! k =1 2k (2n 2k + 1)

REFERENCES

[1] V.S.Adamchik, On Stirling Numbers and Euler Sums.

35

J. Comput. Appl. Math.79, 119-130, 1997.

http://www-2.cs.cmu.edu/~adamchik/articles/stirling.htm
[2] T.M. Apostol, Mathematical Analysis, Second Ed., Addison-Wesley Publishing
Company, Menlo Park (California), London and Don Mills (Ontario), 1974.
[3] B.C. Berndt, Ramanujans Notebooks. Part I, Springer-Verlag, 1985.
[4] M.W. Coffey, A set of identities for a class of alternating binomial sums arising in
computing applications. 2006.
arXiv:math-ph/0608049v1
[5] C.A. Charalambides, Enumerative Combinatorics.
Chapman & Hall/CRC, 2002.
[6] L. Comtet, Advanced Combinatorics, Reidel, Dordrecht, 1974.
[7] D.F. Connon, Some series and integrals involving the Riemann zeta function,
binomial coefficients and the harmonic numbers. Volume I, 2007.
arXiv:0710.4022 [pdf]
[8] D.F. Connon, Some series and integrals involving the Riemann zeta function,
binomial coefficients and the harmonic numbers. Volume II(a), 2007.
arXiv:0710.4023 [pdf]
[9] D.F. Connon, Some integrals involving the Stieltjes constants. 2009.
arXiv:0902.2188 [pdf]
[10] M.A. Coppo, La formule d'Hermite revisite. 2003.
http://math1.unice.fr/~coppo/
[11] A. Devoto and D.W. Duke, Table of integrals and formulae for Feynman
diagram calculations. Florida State University, FSU-HEP-831003, 1983.
http://www.csit.fsu.edu/~dduke/integrals.htm
[12] P. Flajolet and R. Sedgewick, Mellin Transforms and Asymptotics: Finite
Differences and Rices Integrals. Theor. Comput. Sci. 144, 101-124, 1995.
Mellin transforms and asymptotics: Finite differences and Rice's integrals
psu.edu [pdf]
[13] R.L. Graham, D.E. Knuth and O. Patashnik, Concrete Mathematics. Second Ed.
Addison-Wesley Publishing Company, Reading, Massachusetts, 1994.
[14] K.S. Klbig, The complete Bell polynomials for certain arguments in terms of
Stirling numbers of the first kind.
J. Comput. Appl. Math. 51 (1994) 113-116.
Also available electronically at:

36

A relation between the Bell polynomials at certain arguments and a Pochhammer

symbol.
CERN/Computing and Networks Division, CN/93/2, 1993 http://cdsweb.cern.ch/
[15] M.E. Levenson, J.F. Locke and H. Tate, Amer. Math. Monthly, 45, 56-58, 1938.
[16] N.E. Nrlund, Vorlesungen ber Differenzenrechnung.Chelsea, 1954.
http://dz-srv1.sub.uni-goettingen.de/cache/browse/AuthorMathematicaMonograph,WorkContainedN1.html

[17] N.E. Nrlund, Leons sur les sries dinterpolation.

Paris, Gauthier-Villars, 1926.
[18] G. Pyla and G. Szeg, Problems and Theorems in Analysis, Vol. I.
Springer-Verlag, New York 1972.
[19] R.K. Raina and R.K. Ladda, A new family of functional series relations
involving digamma functions.
Ann. Math. Blaise Pascal, Vol. 3, No. 2, 1996, 189-198.
http://www.numdam.org/item?id=AMBP_1996__3_2_189_0
[20] H. Ruben, A Note on the Trigamma Function.
Amer. Math. Monthly, 83, 622-623, 1976.
[21] L.-C. Shen, Remarks on some integrals and series involving the Stirling
numbers and (n). Trans. Amer. Math. Soc. 347, 1391-1399, 1995.
[22] A. Snowden, Collection of Mathematical Articles. 2003.
http://www-users.math.umd.edu/~asnowden/math-cont/dorfman.pdf
[23] H.M. Srivastava and J. Choi, Series Associated with the Zeta and Related
Functions. Kluwer Academic Publishers, Dordrecht, the Netherlands, 2001.
[24] H.S. Wilf, The asymptotic behaviour of the Stirling numbers of the first kind.
Journal of Combinatorial Theory, Series A, 64, 344-349, 1993.
http://citeseer.ist.psu.edu/520553.html
Donal F. Connon
Elmhurst
Dundle Road
Matfield, Kent TN12 7HD
dconnon@btopenworld.com

37