Hyperharmonic number

From Wikipedia, the free encyclopedia

In mathematics, the n-th hyperharmonic number of order r, denoted by , is recursively defined by the relations:

and

[citation needed]

In particular, is the n-th harmonic number.

The hyperharmonic numbers were discussed by J. H. Conway and R. K. Guy in their 1995 book The Book of Numbers.[1]:258

By definition, the hyperharmonic numbers satisfy the recurrence relation

In place of the recurrences, there is a more effective formula to calculate these numbers:

The hyperharmonic numbers have a strong relation to combinatorics of permutations. The generalization of the identity

reads as

where is an r-Stirling number of the first kind.[2]

Asymptotics

The above expression with binomial coefficients easily gives that for all fixed order r>=2 we have.[3]

that is, the quotient of the left and right hand side tends to 1 as n tends to infinity.

An immediate consequence is that

when m>r.

Generating function and infinite series

The generating function of the hyperharmonic numbers is

The exponential generating function is much more harder to deduce. One has that for all r=1,2,...

where 2F2 is a hypergeometric function. The r=1 case for the harmonic numbers is a classical result, the general one was proved in 2009 by I. Mező and A. Dil.[4]

The next relation connects the hyperharmonic numbers to the Hurwitz zeta function:[3]

Integer hyperharmonic numbers

References

Related Articles

Wikiwand AI