The harmonic numbers play an important role in combinatorial problem and numbers theory, and they also frequently appear in the analysis of algorithms and probabilistic statistical calculation. The objective of this paper is using Riordan arrays and generating function to discover identities on the generalized harmonic numbers. The harmonic numbers H n ( n ≥ 0 ) are defined by

H 0 = 0 ,     H n = ∑ k = 1 ∞ 1 k         ( k = 1 , 2 , ⋯ ) .

and the generating function of H n is

∑ n = 0 ∞     H n t n = − ln ( 1 − t ) 1 − t .

The first few harmonic numbers are 1, 3 2 , 11 6 , 25 12 , 137 60 , ⋯ . The harmonic numbers

H n have been generalized by several authors. For other generalizations of the harmonic numbers, one can consult [1] [2]. One of them is the generalized harmonic numbers H n , k , r ( α , β ) defined by see [3] [4]: k , r ≥ 1 are integers, α , β are real numbers, and α β ≠ 0 .

∑ n = 0 ∞     H n , k , r ( α , β ) t n = ( − ln ( 1 − α t ) ) r ( 1 − β t ) k . (1)

For convenience, we recall some definitions involved in the paper as following [5] - [17].

High order Changhee polynomial of the first kind C h n ( k ) ( x ) and the second kind C ^ h n ( k ) ( x ) has the following generating function

∑ n = 0 ∞     C h n ( k ) ( x ) t n n ! = ( 2 ( 1 + t ) + 1 ) k ( 1 + t ) x , (2)

∑ n = 0 ∞     C ^ h n ( k ) ( x ) t n n ! = ( 2 ( 1 + t ) ( 1 + t ) + 1 ) k ( 1 + t ) x . (3)

when x = 0 , C h n ( k ) = C h n ( k ) ( 0 ) and C ^ h n ( k ) = C ^ h n ( k ) ( 0 ) are called the high order Changhee numbers of the first kind and the second kind.

High order Daehee polynomial of the first kind D n ( k ) ( x ) and the second kind D ^ n ( k ) ( x ) has the following generating function

∑ n = 0 ∞     D n ( k ) ( x ) t n n ! = ( ln ( 1 + t ) t ) k ( 1 + t ) x , (4)

∑ n = 0 ∞     D ^ n ( k ) ( x ) t n n ! = ( ( 1 + t ) ln ( 1 + t ) t ) k ( 1 + t ) x . (5)

when x = 0 , D n ( k ) = D n ( k ) ( 0 ) and D ^ n ( k ) = D ^ n ( k ) ( 0 ) are called the high order Daehee numbers of the first kind and the second kind.

High order Apostol Changhee polynomial C h n ( k ) ( x : λ ) has the following generating function

∑ n = 0 ∞     C h n ( k ) ( x : λ ) t n n ! = ( 2 λ ( 1 + t ) + 1 ) k ( 1 + t ) x . (6)

when x = 0 , C h n ( k ) ( λ ) = C h n ( k ) ( 0 : λ ) are called the high order Apostol Changhee numbers.

High order Apostol Daehee polynomial D n ( k ) ( x : λ ) has the following generating function

∑ n = 0 ∞     D n ( k ) ( x : λ ) t n n ! = ( ln ( 1 + t ) λ ( 1 + t ) − 1 ) k ( 1 + t ) x . (7)

when x = 0 , D n ( k ) ( λ ) = D n ( k ) ( 0 : λ ) are called the high order Apostol Daehee numbers.

High order Apostol Bernoulli polynomial B n ( k ) ( x : λ ) has the following generating function

∑ n = 0 ∞     B n ( k ) ( x : λ ) t n n ! = ( t λ e t − 1 ) k e x t . (8)

when x = 0 , B n ( k ) ( λ ) = B n ( k ) ( 0 : λ ) are called the high order Apostol Bernoulli numbers.

High order Apostol Euler polynomial E n ( k ) ( x : λ ) has the following generating function

∑ n = 0 ∞     E n ( k ) ( x : λ ) t n n ! = ( 2 λ e t + 1 ) k e x t . (9)

when x = 0 , E n ( k ) ( λ ) = E n ( k ) ( 0 : λ ) are called the high order Apostol Euler numbers.

High order Apostol Genocchi polynomial G n ( k ) ( x : λ ) has the following generating function

∑ n = 0 ∞     G n ( k ) ( x : λ ) t n n ! = ( 2 t λ e t + 1 ) k e x t . (10)

when x = 0 , G n ( k ) ( λ ) = G n ( k ) ( 0 : λ ) are called the high order Apostol Genocchi numbers.

When λ = 1 in (10), we get the generating function of high order Genocchi polynomials G n ( k ) ( x )

∑ n = 0 ∞     G n ( k ) ( x ) t n n ! = ( 2 t e t + 1 ) k e x t . (11)

The degenerate Changhee polynomials of the second kind C h n , λ ( x ) have the following generating function

∑ n = 0 ∞     C h n , λ ( x ) t n n ! = 2 1 + ( 1 + λ ln ( 1 + t ) ) 1 λ ( 1 + λ ln ( 1 + t ) ) x λ . (12)

The degenerate Euler polynomial E n , λ ( x ) has the following generating function

∑ n = 0 ∞     E n , λ ( x ) t n n ! = 2 1 + ( 1 + λ t ) 1 λ ( 1 + λ t ) x λ . (13)

The degenerate Genocchi polynomial G n , λ ( x ) has the following generating function

∑ n = 0 ∞     G n , λ ( x ) t n n ! = 2 t 1 + ( 1 + λ t ) 1 λ ( 1 + λ t ) x λ . (14)

The degenerate Changhee-Genocchi polynomial of the second kind C G n , λ ( x ) has the following generating function

∑ n = 0 ∞     C G n , λ ( x ) t n n ! = 2 ln ( 1 + t ) 1 + ( 1 + λ ln ( 1 + t ) ) 1 λ ( 1 + λ ln ( 1 + t ) ) x λ . (15)

The degenerate stirling numbers of first kind and second kind have following generating function

∑ n ≥ k     s 1 , λ ( n , k ) t n n ! = ( 1 λ ( ( 1 + t ) λ − 1 ) ) k k ! , (16)

∑ n ≥ k     S 2 , λ ( n , k ) t n n ! = ( ( 1 + λ t ) 1 λ − 1 ) k k ! . (17)

Generalized Harmonic polynomial H n ( r ) ( z ) has the following generating function

∑ n = r ∞     H n ( r ) ( z ) t n = ( − ln ( 1 − t ) ) r + 1 t ( 1 − t ) ( 1 − t ) z . (18)

with H 0 ( r ) ( z ) = 1 , and we also obtain when r = 0 ,   z = 0 , H n − 1 ( 0 ) ( 0 ) = H n ( n ≥ 1 ) .

Let n ≥ k + r , the combinatorial numbers P ( r , n + k , k ) has the following generating function

∑ n = 0 ∞ ( n + k k ) P ( r , n + k , k ) t n = ( − ln ( 1 − t ) ) r ( 1 − t ) k + 1 . (19)

Lemma 1. If D ( g ( t ) , f ( t ) ) = ( d n , k ) n . k ∈ N is a Riordan array and h ( t ) is the generating function of the sequence { ( h k ) k ∈ N } , then we have ( [18])

∑ k = 0 n     d n , k h k = [ t n ] g ( t ) h ( f ( t ) ) . (20)

In this part, using generating functions and coefficient method we discuss some interesting relationships of generalized harmonic numbers H n , k , r ( α , β ) .

Theorem 2.1. Let n is a nonnegative integer, we have

∑ j = 0 n     H j , k , r ( α , β ) ( − 2 β ) n − j C h n − j ( m ) ( n − j ) ! = H n , k + m , r ( α , β )   , (21)

∑ j = 0 n     H j , k , r ( α , β ) ( − 2 β ) n − j C ^ h n − j ( m ) ( n − j ) ! = ∑ i = 0 n ( − 2 β ) n − i ( m n − i ) H i , k + m , r ( α , β ) . (22)

Proof. By (1) and (2), we get

∑ n = 0 ∞   ∑ j = 0 n     H j , k , r ( α , β ) ( − 2 β ) n − j C h n − j ( m ) ( n − j ) ! t n = ( − ln ( 1 − α t ) ) r ( 1 − β t ) k + m = ∑ n = 0 ∞     H n , k + m , r ( α , β ) t n .

Comparing the coefficients of t n in both sides of the last equation, we get the identity. (22) can be obtained in the same way.

Corollary 2.1. For m = 1 in Theorem 2.1, we obtain the following identities

∑ j = 0 n     H j , k , r ( α , β ) ( − 2 β ) n − j C h n − j ( n − j ) ! = H n , k + 1 , r ( α , β ) , (23)

∑ j = 0 n     H j , k , r ( α , β ) ( − 2 β ) n − j C ^ h n − j ( n − j ) ! = H n , k + 1 , r ( α , β ) − 2 β H n − 1 , k + 1 , r ( α , β ) . (24)

Corollary 2.2. For β = α in Corollary 2.1, we obtain the following identities

∑ j = 0 n ( − 2 ) n − j H j , k , r ( α , α ) C h n − j α j ( n − j ) ! = ( n + k k ) P ( r , n + k , k ) , (25)

∑ j = 0 n ( − 2 ) n − j H j , k , r ( α , α ) C ^ h n − j α j ( n − j ) ! = ( n + k k ) P ( r , n + k , k ) − 2 β ( n + k − 1 k ) P ( r , n + k − 1 , k ) . (26)

Theorem 2.2. Let n is a nonnegative integer, we have

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 2 α ) n − j C h n − j ( m ) ( n − j ) ! = H n , m , r ( α , α ) , (27)

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 2 α ) n − j C ^ h n − j ( m ) ( n − j ) ! = ∑ i = 0 n ( − 2 α ) n − i ( m n − i ) H i , m , r ( α , α ) . (28)

Proof. By (1) and (2), we have

∑ n = 0 ∞   ∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 2 α ) n − j C h n − j ( m ) ( n − j ) ! t n = ( − ln ( 1 − α t ) ) r ( 1 − α t ) m = ∑ n = 0 ∞     H n , m , r ( α , α ) t n .

Comparing the coefficients of t n in both sides of the last equation, we get the identity. (28) can be obtained in the same way.

Corollary 2.3 For m = 1 in Theorem 2.2, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 2 α ) n − j C h n − j ( n − j ) ! = α n H ( n , r − 1 ) , (29)

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 2 α ) n − j C ^ h n − j ( n − j ) ! = α n ( H ( n , r − 1 ) − 2 α H ( n − 1 , r − 1 ) ) . (30)

For β = α = m = 1 in (27), the Theorem 2.3 in [5] is as follows

∑ j = 0 n ( − 2 ) n − k C h n − j ( n − j ) ! ( n + k − 1 k − 1 ) P ( r , n + k − 1 , k − 1 ) = ( n + k + r − 1 k + r − 1 ) P ( r , n + k + r − 1 , k + r − 1 ) . (31)

Theorem 2.3. Let n be a nonnegative integer, we have

∑ j = 0 n     H j , k , r ( α , β ) ( − α ) n − j D n − j ( m ) ( n − j ) ! = H n + m , k , r + m ( α , β ) α m , (32)

∑ j = 0 n     H j , k , r ( α , β ) ( − α ) n − j D ^ n − j ( m ) ( n − j ) ! = ∑ i = 0 n ( − 1 ) n − i α n − m − i ( m n − i ) H i + m , k , r + m ( α , β ) . (33)

Proof. By (1) and (4), we get

∑ n = 0 ∞   ∑ j = 0 n     H j , k , r ( α , β ) ( − α ) n − j D n − j ( m ) ( n − j ) ! t n = ( − ln ( 1 − α t ) ) r ( 1 − β t ) k ( ln ( 1 − α t ) − α t ) m = 1 ( α t ) m ( − ln ( 1 − α t ) ) r + m ( 1 − β t ) k = 1 α m ∑ n = m ∞     H n + m , k , r + m ( α , β )   t n .

Comparing the coefficients of t n in both sides of the last equation, we get the identity. (33) can be obtained in the same way.

Corollary 2.4. For m = 1 in Theorem 2.3, we obtain the following identities

∑ j = 0 n     H j , k , r ( α , β ) ( − α ) n − j D n − j ( n − j ) ! = H n + 1 , k , r + 1 ( α , β )   α , (34)

∑ j = 0 n     H j , k , r ( α , β ) ( − α ) n − j D ^ n − j ( n − j ) ! = H n + 1 , k , r + 1 ( α , β )   α − H n , k , r + 1 ( α , β )   . (35)

Corollary 2.5. For β = α in Corollary 2.4, we obtain the following identities

∑ j = 0 n     H j , k , r ( α , α ) ( − α ) n − j D n − j ( n − j ) ! = α n ( n + k k − 1 ) P ( r + 1 , n + k , k − 1 ) , (36)

∑ j = 0 n     H j , k , r ( α , α ) ( − α ) n − j D ^ n − j ( n − j ) ! = α n ( n + k − 1 k − 2 ) P ( r + 1 , n + k − 1 , k − 2 ) . (37)

Theorem 2.4. Let n be a nonnegative integer, we have

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r + 1 ( α , β ) ( − α ) n − j D n − j ( m ) ( x ) ( n − j ) ! = α n H n + m − 1 ( m + r ) ( 1 + x ) , (38)

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r + 1 ( α , β ) ( − α ) n − j D ^ n − j ( m ) ( x ) ( n − j ) ! = α n H n + m − 1 ( m + r ) ( 1 + x + m ) . (39)

Proof. By (1) and (4), we get

∑ n = 0 ∞   ∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r + 1 ( α , β ) ( − α ) n − j D n − j ( m ) ( x ) ( n − j ) ! t n = ( − ln ( 1 − α t ) ) r + 1 ( ln ( 1 − α t ) − α t ) m ( 1 − α t ) x = 1 ( α t ) m − 1 ( − ln ( 1 − α t ) ) m + r + 1 α t ( 1 − α t ) − x = ∑ n = r + 1 ∞     α n H n + m − 1 ( m + r ) ( 1 + x ) t n .

Comparing the coefficients of t n in both sides of the last equation, we get the identity. (39) can be obtained in the same way.

Corollary 2.7. For m = 1 in Theorem 2.4, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r + 1 ( α , β ) ( − α ) n − j D n − j ( x ) ( n − j ) ! = α n H n ( r + 1 ) ( 1 + x ) , (40)

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r + 1 ( α , β ) ( − α ) n − j D ^ n − j ( x ) ( n − j ) ! = α n H n ( r + 1 ) ( 2 + x ) . (41)

Corollary 2.8. For x = 0 in Corollary 2.7, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − 1 ) n + h − j β h H j − h , k , r + 1 ( α , β ) D n − j α j ( n − j ) ! = ( r + 2 ) ! ( n + 1 ) ! | s ( n + 1 , r + 2 ) | , (42)

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − 1 ) n + h − j β h H j − h , k , r + 1 ( α , β ) D ^ n − j α j ( n − j ) ! = ( r + 2 ) ! n ! ( | s ( n + 1 , r + 2 ) | n + 1 − | s ( n , r + 2 ) | ) . (43)

Theorem 2.5. Let n ≥ r ≥ 1 be a nonnegative integer, we have

∑ i = 0 n − r ( n − r i ) ( − 1 ) n − r α n − i ( 2 β ) i C h i ( k ) D n − r − i ( r ) ( n − r ) ! = H n , k , r ( α , β ) . (44)

Proof. By (1), (2) and (4), we get

∑ n = 0 ∞     H n , k , r ( α , β ) t n = ( − ln ( 1 − α t ) ) r ( 1 − β t ) k = ( 1 1 − β t ) k ( − ln ( 1 − α t ) α t ) r ( α t ) r = ∑ n = 0 ∞     C h n ( k ) ( − 2 β ) n t n n ! ∑ n = 0 ∞     D n ( r ) ( − α ) n t n n ! ( α t ) r = ∑ n = 0 ∞   ∑ i = 0 n ( n i ) ( − 1 ) n α n + r − i ( 2 β ) i C h i ( k ) D n − i ( r ) t n + r n ! = ∑ n = r ∞   ∑ i = 0 n − r ( n − r i ) ( − 1 ) n − r α n − i ( 2 β ) i C h i ( k ) D n − r − i ( r ) ( n − r ) ! t n .

Comparing the coefficients of t n in both sides of the last equation, we get the identity.

Corollary 2.9. For α = β = k = r = 1 in Theorem 2.5, we obtain the following identities

∑ i = 0 n − 1 ( n − 1 i ) ( − 1 ) n − 1 2 i C h i D n − i − 1 ( n − 1 ) ! = H n ,   ( n > 1 ) ,   H 1 = 0. (45)

In this part, using Riordan arrays, we derive some new equalities between Generalized Harmonic number H n , k , r ( α , β ) and Apostol Bernoulli polynomials, Apostol Euler polynomials, Apostol Genocchi polynomials.

Theorem 3.1. Let n be a nonnegative integer, we have

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j B j ( m ) ( x : λ ) j ! = α n ∑ l = 0 n     λ l ( l + m − 1 l ) H n − 1 ( m − 1 ) ( x + l + 1 ) = ( − α ) n D n ( m ) ( x : λ ) n ! . (46)

Proof. An interesting Riordan arrays, associated with the H n , k , r ( α , β ) are defined by

ℜ { ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) } = ( 1 , − ln ( 1 − α t ) ) . (47)

On the one hand, by (8), (47) and Lemma 1, we get

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j B j ( m ) ( x : λ ) j ! = [ t n ] [ ( − y λ e − y − 1 ) m e − x y | y = − ln ( 1 − α t ) ] = [ t n ] ( ln ( 1 − α t ) λ ( 1 − α t ) − 1 ) m ( 1 − α t ) x = ( − α ) n D n ( m ) ( x : λ ) n ! .

On the other hand, we get

[ t n ] ( ln ( 1 − α t ) λ ( 1 − α t ) − 1 ) m ( 1 − α t ) x = [ t n ] ( − ln ( 1 − α t ) ) m ( 1 − α t ) − x ( 1 − λ ( 1 − α t ) ) − m = [ t n ] ( − ln ( 1 − α t ) ) m ( 1 − α t ) − x − l ∑ l = 0 m     λ l ( l + m − 1 l ) = α [ t n − 1 ] ( − ln ( 1 − α t ) ) m α t ( 1 − α t ) − x − l ∑ l = 0 m     λ l ( l + m − 1 l ) = α n ∑ l = 0 m     λ l ( l + m − 1 l ) H n − 1 ( m − 1 ) ( x + l + 1 ) .

which completes the proof.

Corollary 3.1. For λ = 1 in Theorem 3.1, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j B j ( m ) ( x ) j ! = α n ∑ l = 0 n ( l + m − 1 l ) H n − 1 ( m − 1 ) ( x + l + 1 ) = ( − α ) n D n ( m ) ( x ) n ! . (48)

Corollary 3.2. For m = 1 in Corollary 3.1, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j B j ( x ) j ! = α n ∑ l = 0 n     H n − 1 ( x + l + 1 ) = ( − α ) n D n ( x ) n ! . (49)

Corollary 3.3. For x = 0 in Corollary 3.2, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j B j j ! = α n ∑ l = 0 n     H n ( − l ) = ( − α ) n D n n ! . (50)

Theorem 3.2. Let n be a nonnegative integer, we have

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 2 ) j B j ( m ) ( x : λ 2 ) j ! = ( − α ) n n ! ∑ i = 0 n ( n i ) C h i ( m ) ( x : λ ) D n − i ( m ) ( x : λ ) . (51)

Proof. By (8), (47) and Lemma 1, we get

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 2 ) j B j ( m ) ( x : λ 2 ) j ! = [ t n ] [ ( − 2 y λ 2 e − 2 y − 1 ) m e − 2 x y | y = − ln ( 1 − α t ) ] = [ t n ] ( 2 ln ( 1 − α t ) λ 2 ( 1 − α t ) 2 − 1 ) m ( 1 − α t ) 2 x = [ t n ] ( 2 λ ( 1 − α t ) + 1 ) m ( ln ( 1 − α t ) λ ( 1 − α t ) − 1 ) m ( 1 − α t ) 2 x = ∑ i = 0 n [ t i ] ( 2 λ ( 1 − α t ) + 1 ) m ( 1 − α t ) x [ t n − i ] ( ln ( 1 − α t ) λ ( 1 − α t ) − 1 ) m ( 1 − α t ) x = ∑ i = 0 n ( − α ) n C h i ( m ) ( x : λ ) i ! D n − i ( m ) ( x : λ ) ( n − i ) ! = ( − α ) n n ! ∑ i = 0 n ( n i ) C h i ( m ) ( x : λ ) D n − i ( m ) ( x : λ ) .

which completes the proof.

Corollary 3.4. For λ = 1 in Theorem 3.2, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 2 ) j B j ( m ) ( x ) j ! = ( − α ) n n ! ∑ i = 0 n ( n i ) C h i ( m ) ( x ) D n − i ( m ) ( x ) . (52)

Corollary 3.5. For m = 1 in Corollary 3.4, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 2 ) j B j ( x ) j ! = ( − α ) n n ! ∑ i = 0 n ( n i ) C h i ( x ) D n − i ( x ) . (53)

Corollary 3.6. For x = 0 in Corollary 3.5, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 2 ) j B j j ! = ( − α ) n n ! ∑ i = 0 n ( n i ) C h i D n − i . (54)

Theorem 3.3. Let n ≥ i ≥ 1 be a nonnegative integer, we have

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j E j ( m ) ( x : λ ) j ! = 2 m ∑ i = 0 n ( − 1 ) n − i α n λ i ( λ + 1 ) m + i ( i + m − 1 i ) ( x n − i ) = ( − α ) n C h n ( m ) ( x : λ ) n ! . (55)

Proof. On the one hand, by (9), (47) and Lemma 1, we get

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j E j ( m ) ( x : λ ) j ! = [ t n ] [ ( 2 λ e − y + 1 ) m e − x y | y = − ln ( 1 − α t ) ] = [ t n ] ( 2 λ ( 1 − α t ) + 1 ) m ( 1 − α t ) x = ( − α ) n C h n ( m ) ( x : λ ) n ! .

On the other hand, we get

[ t n ] ( 2 λ ( 1 − α t ) + 1 ) m ( 1 − α t ) x = [ t n ] ( 2 λ ) m ( λ + 1 λ − α t ) − m ( 1 − α t ) x = ( 2 λ ) m ∑ i = 0 n [ t i ] ( λ + 1 λ − α t ) − m [ t n − i ] ( 1 − α t ) x = ( 2 λ + 1 ) m ∑ i = 0 n [ t i ] ( 1 − λ α λ + 1 t ) − m [ t n − i ] ( 1 − α t ) x = ( 2 λ + 1 ) m ∑ i = 0 n ( i + m − 1 i ) ( λ α λ + 1 ) i ( x n − i ) ( − α ) n − i = 2 m ∑ i = 0 n ( − 1 ) n − i α n λ i ( λ + 1 ) m + i ( i + m − 1 i ) ( x n − i ) .

which completes the proof.

Corollary 3.7. For λ = 1 in Theorem 3.3, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j E j ( m ) ( x ) j ! = ∑ i = 0 n ( − 1 ) n − i α n 2 i ( i + m − 1 i ) ( x n − i ) = ( − α ) n C h n ( m ) ( x ) n ! . (56)

Corollary 3.8. For x = 0 in Corollary 3.7, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j E j ( m ) j ! = α n 2 n ( n + m − 1 n ) = ( − α ) n C h n ( m ) n ! . (57)

Corollary 3.9. For m = 1 in Corollary 3.8, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j E j j ! = α n 2 n = ( − α ) n C h n n ! . (58)

Theorem 3.4. Let n be a nonnegative integer, we have

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − 1 ) m + h + j β h H j − h , k , r ( α , β ) G j ( m ) ( x : λ ) j ! = ∑ i = 0 n ( − α ) n C h n − i ( m ) ( x + 1 , λ ) H ( i , m − 1 ) ( n − i ) ! . (59)

Proof. By (10), (47) and Lemma 1, we get

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j G j ( m ) ( x : λ ) j ! = [ t n ] [ ( − 2 y λ e − y + 1 ) m e − x y | y = − ln ( 1 − α t ) ] = [ t n ] ( 2 ln ( 1 − α t ) λ ( 1 − α t ) + 1 ) m ( 1 − α t ) x = [ t n ] ( 2 λ ( 1 − α t ) + 1 ) m ( 1 − α t ) x + 1 ( − 1 ) m ( − ln ( 1 − α t ) ) m 1 − α t = ( − 1 ) m ∑ i = 0 n [ t n − i ] ( 2 λ ( 1 − α t ) + 1 ) m ( 1 − α t ) x + 1 [ t i ] ( − ln ( 1 − α t ) ) m 1 − α t = ( − 1 ) m ∑ i = 0 n ( − α ) n C h n − i m ( x + 1 , λ ) H ( i , m − 1 ) ( n − i ) ! .

which completes the proof.

Corollary 3.10. For λ = 1 in Theorem 3.4, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − 1 ) m + h + j β h H j − h , k , r ( α , β ) G j ( m ) ( x ) j ! = ∑ i = 0 n ( − α ) n C h n − i ( m ) ( x + 1 ) H ( i , m − 1 ) ( n − i ) ! . (60)

Corollary 3.11. For m = 1 in Corollary 3.10, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − 1 ) h + j + 1 β h H j − h , k , r ( α , β ) G j ( x ) j ! = ∑ i = 0 n ( − α ) n C h n − i ( x + 1 ) H i ( n − i ) ! . (61)

Corollary 3.12. For x = 0 in Corollary 3.11, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − 1 ) h + j + 1 β h H j − h , k , r ( α , β ) G j j ! = ∑ i = 0 n ( − α ) n C ^ h n − i H i ( n − i ) ! . (62)

Theorem 3.5. Let n be a nonnegative integer, we have

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j G j ( m ) ( 2 x ) j ! = ( − α ) n ( n − m ) ! ∑ i = 0 n − m ( n − m i ) C h i ( m ) ( x ) D n − m − i ( m ) ( x ) . (63)

Proof. By (11), (47) and Lemma 1, we get

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j G j ( m ) ( 2 x ) j ! = [ t n ] [ ( − 2 y e − y + 1 ) m e − 2 x y | y = − ln ( 1 − α t ) ]

= [ t n ] ( 2 ln ( 1 − α t ) 2 − α t ) m ( 1 − α t ) 2 x = [ t n ] ( 2 2 − α t ) m ( 1 − α t ) x ( − ln ( 1 − α t ) α t ) m ( 1 − α t ) x ( − α t ) m

= [ t n − m ] ( − α ) m ( 2 2 − α t ) m ( 1 − α t ) x ( ln ( 1 − α t ) − α t ) m ( 1 − α t ) x = ( − α ) m ∑ i = 0 n [ t i ] ( 2 2 − α t ) m ( 1 − α t ) x [ t n − m − i ] ( ln ( 1 − α t ) − α t ) m ( 1 − α t ) x = ∑ i = 0 n ( − α ) n C h i ( m ) ( x ) i ! D n − m − i ( m ) ( x ) ( n − m − i ) ! = ( − α ) n ( n − m ) ! ∑ i = 0 n − m ( n − m i ) C h i ( m ) ( x ) D n − m − i ( m ) ( x ) .

which completes the proof.

Corollary 3.13. For x = 0 in Theorem 3.5, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j G j ( m ) j ! = ( − α ) n ( n − m ) ! ∑ i = 0 n − m ( n − m i ) C h i ( m ) D n − m − i ( m ) . (64)

Corollary 3.14. For m = 1 in Corollary 3.13, we obtain the following identities

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − 1 ) j G j j ! = ( − α ) n ( n − 1 ) ! ∑ i = 0 n − 1 ( n − 1 i ) C h i D n − i − 1 . (65)

In this part, using generating functions and coefficient method, we derive the new identities involving Generalized Harmonic number H n , k , r ( α , β ) , with Degenerate Changhee polynomials, Degenerate Genocchi polynomials, Degenerate Changhee-Genocchi polynomials, Two kinds of degenerate Stirling numbers and so on.

Theorem 4.1. Let n be a nonnegative integer, we have

∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − α ) n − j C h n − j , λ ( r ) ( x ) ( n − j ) ! = ( − 1 ) n + r α n C G n , λ ( r ) ( x ) n ! . (66)

Proof. By (1) and (12), we get

∑ n = 0 ∞   ∑ j = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , r ( α , β ) ( − α ) n − j C h n − j , λ ( r ) ( x ) ( n − j ) ! t n = ( − ln ( 1 − α t ) ) r ( 2 1 + ( 1 + λ ln ( 1 − α t ) ) 1 λ ) r ( 1 + λ ln ( 1 − α t ) ) x λ

= ( − 1 ) r ( 2 ln ( 1 − α t ) 1 + ( 1 + λ ln ( 1 − α t ) ) 1 λ ) r ( 1 + λ ln ( 1 − α t ) ) x λ = ( − 1 ) r ∑ n = 0 ∞     C G n , λ ( r ) ( x ) ( − α t ) n n ! .

Comparing the coefficients of t n in both sides of the last equation, we get the identity.

Theorem 4.2. Let n be a nonnegative integer, we have

∑ j = 0 n   ∑ m = 0 j   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , m ( α , β ) ( − 1 ) m ( − α ) n − j ( x ) m , λ C G n − j , λ m ! ( n − j ) ! = ( − α ) n C G n , λ ( x ) n ! . (67)

The λ -analogue of falling factorial sequence is given by ( x ) m λ = x ( x − λ ) ⋯ ( x − ( m − 1 ) λ ) , ( m ≥ 0 ) , ( x ) 0 , λ = 1 .

Proof. By (14), we get

∑ n = 0 ∞     C G n , λ ( x ) ( − α t ) n n ! = 2 ln ( 1 − α t ) 1 + ( 1 + λ ln ( 1 − α t ) ) 1 λ ( 1 + λ ln ( 1 − α t ) ) x λ = ∑ n = 0 ∞     C G n , λ ( − α t ) n n ! ∑ m = 0 ∞ ( x λ m ) λ m ln m ( 1 − α t ) = ∑ n = 0 ∞     C G n , λ ( − α t ) n n ! ∑ m = 0 ∞ ( − 1 ) m ( x ) m , λ m ! ( − ln ( 1 − α t ) ) m

= ∑ n = 0 ∞     C G n , λ ( − α t ) n n ! ∑ m = 0 ∞ ( − 1 ) m ( x ) m , λ m ! ∑ n = 0 ∞   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , m ( α , β ) t n = ∑ n = 0 ∞     C G n , λ ( − α t ) n n ! ∑ n = 0 ∞   ∑ m = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , m ( α , β ) ( − 1 ) m ( x ) m , λ m ! t n = ∑ n = 0 ∞   ∑ j = 0 n   ∑ m = 0 j   ∑ h = 0 k ( k h ) ( − β ) h H j − h , k , m ( α , β ) ( − 1 ) m ( − α ) n − j ( x ) m , λ C G n − j , λ m ! ( n − j ) ! t n .

Comparing the coefficients of t n in both sides of the last equation, we get the identity.

Theorem 4.3. Let n be a nonnegative integer, we have

∑ m = 0 n   ∑ h = 0 k ( k h ) ( − 1 ) m + h + 1 β h ( x ) m , λ H n − h , k , n + m + 1 ( α , β ) m ! = ( − α ) n ( C G n , λ ( x + 1 ) + C G n , λ ( x ) ) 2 n ! . (68)

Proof. By (14), we get

∑ n = 0 ∞ ( C G n , λ ( x + 1 ) + C G n , λ ( x ) ) ( − α t ) n n ! = 2 ln ( 1 − α t ) 1 + ( 1 + λ ln ( 1 − α t ) ) 1 λ ( 1 + λ ln ( 1 − α t ) ) x + 1 λ     + 2 ln ( 1 − α t ) 1 + ( 1 + λ ln ( 1 − α t ) ) 1 λ ( 1 + λ ln ( 1 − α t ) ) x λ = 2 ln ( 1 − α t ) ( 1 + λ ln ( 1 − α t ) ) x λ

= 2 ln ( 1 − α t ) ∑ m = 0 ∞ ( x λ m ) λ m ln m ( 1 − α t ) = 2 ∑ m = 0 ∞ ( x λ m ) λ m ( − 1 ) m + 1 ( − ln ( 1 − α t ) ) m + 1 = 2 ∑ m = 0 ∞ ( − 1 ) m + 1 ( x ) m , λ m ! ∑ n = 0 ∞   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , m + 1 ( α , β )   t n = 2 ∑ n = 0 ∞   ∑ m = 0 n   ∑ h = 0 k ( k h ) ( − 1 ) m + h + 1 β h ( x ) m , λ H n − h , k , m + 1 ( α , β )   m ! t n .

Comparing the coefficients of t n in both sides of the last equation, we get the identity.

Theorem 4.4. Let n be a nonnegative integer, we have

∑ m = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , m ( α , β )   ( − 1 ) m E m , λ ( l ) ( x ) m ! = ( − α ) n C h n , λ ( l ) ( x ) n ! . (69)

Proof. By (1) and (13), we get

∑ n = 0 ∞   ∑ m = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , m ( α , β )   ( − 1 ) m E m , λ ( l ) ( x ) m ! t n = ∑ m = 0 ∞     E m , λ ( l ) ( x ) ( − 1 ) m m ! ∑ n = 0 ∞   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , m ( α , β )   t n = ∑ m = 0 ∞     E m , λ ( l ) ( x ) ( − 1 ) m m ! ( − ln ( 1 − α t ) ) m = ∑ m = 0 ∞     E m , λ ( l ) ( x ) ln m ( 1 − α t ) m ! = ( 2 1 + ( 1 + λ ln ( 1 − α t ) ) 1 λ ) l ( 1 + λ ln ( 1 − α t ) ) x λ = ∑ n = 0 ∞     C h n , λ ( l ) ( x ) ( − α ) n t n n ! .

Comparing the coefficients of t n in both sides of the last equation, we get the identity.

Theorem 4.5. Let n be a nonnegative integer, we have

∑ m = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , m ( α , β )   ( − 1 ) m G m , λ ( l ) ( x ) m ! = ( − α ) n C G n , λ ( l ) ( x ) n ! . (70)

Proof. By (1) and (14), we get

∑ n = 0 ∞   ∑ m = 0 n   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , m ( α , β )   ( − 1 ) m G m , λ ( l ) ( x ) m ! t n = ∑ m = 0 ∞     G m , λ ( l ) ( x ) ( − 1 ) m m ! ∑ n = 0 ∞   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , m ( α , β )   t n = ∑ m = 0 ∞     G m , λ ( l ) ( x ) ( − 1 ) m m ! ( − ln ( 1 − α t ) ) m = ∑ m = 0 ∞     G m , λ ( l ) ( x ) ln m ( 1 − α t ) m ! = ( 2 ln ( 1 − α t ) 1 + ( 1 + λ ln ( 1 − α t ) ) 1 λ ) l ( 1 + λ ln ( 1 − α t ) ) x λ = ∑ n = 0 ∞     C G n , λ ( l ) ( x ) ( − α ) n t n n ! .

Comparing the coefficients of t n in both sides of the last equation, we get the identity.

The combined inversion relations are introduced below (see [19]):

f n = ∑ k = 0 n     S ( n , k ) g k ⇔ g n = ∑ k = 0 n     s ( n , k ) f k . (*)

where f n and g n are two sequences, expressed as following

f = ∑ n = 0 ∞     f n t n n ! ,       g = ∑ n = 0 ∞     g n t n n ! .

Theorem 4.6. Let m ≥ r ≥ 1 be a nonnegative integer, we have

∑ n = 0 m   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , r ( α , β ) ( − λ ) n − r n ! s 1 , λ ( m , n ) α n = ( m ) r D m − r ( r ) , (71)

∑ h = 0 k ( − β ) h H n − h , k , r ( α , β )   ( − λ ) m − r m ! α m = ∑ n = 0 m ( n ) r D n − r ( r ) S 2 , λ ( m , n ) . (72)

Proof. Let t = 1 − ( 1 + t ) λ α , by (1) and (16), we get

∑ m = 0 ∞   ∑ n = 0 m   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , r ( α , β )   ( − λ ) n n ! s 1 , λ ( m , n ) α n t m m ! = ∑ n = 0 ∞   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , r ( α , β )   ( − λ ) n n ! α n ∑ m = 0 ∞     s 1 , λ ( m , n ) t m m ! = ∑ n = 0 ∞   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , r ( α , β )   ( − λ ) n n ! α n ( 1 λ ( ( 1 + t ) λ − 1 ) ) n n ! = ∑ n = 0 ∞   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , r ( α , β )   ( 1 − ( 1 + t ) λ α ) n = ( − λ ln ( 1 + t ) ) r = ( − λ ) r ( ln ( 1 + t ) t ) r t r = ( − λ ) r ∑ m = r ∞ ( m ) r D m − r ( r ) t m m ! .

Comparing the coefficients of t m m ! in both sides of the last equation, we get the identity.

In addition, from the inversion formula (*), we can get (72).

Theorem 4.7. Let n ≥ k ≥ 1 be a nonnegative integer, we have

∑ l = k n   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , l ( α , β )   ( − 1 ) l λ l − k l ! S ( l , k ) = ( − α ) n s 1 , λ ( n , k ) n ! , (73)

∑ l = k n ( − α ) l s 1 , λ ( l , k ) l ! s ( l , k ) = ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , l ( α , β )   ( − 1 ) n λ n − k n ! . (74)

Proof. By (16), we get

∑ n = 0 ∞     s 1 , λ ( n , k ) ( − α ) n t n n ! = ( 1 λ ( ( 1 − α t ) λ − 1 ) ) k k ! = 1 λ k ( e λ ln ( 1 − α t ) − 1 ) k k ! = 1 λ k ∑ l = k ∞     S ( l , k ) ( λ ln ( 1 − α t ) ) l l ! = ∑ l = k ∞ ( − 1 ) l λ l − k S ( l , k ) l ! ( − ln ( 1 − α t ) ) l = ∑ l = k ∞ ( − 1 ) l λ l − k S ( l , k ) l ! ∑ n = 0 ∞   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , l ( α , β )   t n = ∑ n = 0 ∞   ∑ l = k n   ∑ h = 0 k ( k h ) ( − β ) h H n − h , k , l ( α , β )   ( − 1 ) l λ l − k S ( l , k ) l ! t n .

Comparing the coefficients of t n in both sides of the last equation, we get the identity.

In addition, from the inversion formula (*), we can get (74).

Supported by the National Natural Science Foundation of China under Grant 11461050 and Natural Science Foundation of Inner Mongolia 2020MS01020.

The authors declare no conflicts of interest regarding the publication of this paper.

Wang, R. and Wuyungaowa (2022) Generalized Harmonic Numbers with Combinatorial Sequences. Journal of Applied Mathematics and Physics, 10, 1602-1618. https://doi.org/10.4236/jamp.2022.105111