Generalized harmonic numbers The
nth
generalized harmonic number of order
m is given by H_{n,m}=\sum_{k=1}^n \frac{1}{k^m}. (In some sources, this may also be denoted by H_n^{(m)} or H_m(n).) The special case
m = 0 gives H_{n,0}= n. The special case
m = 1 reduces to the usual harmonic number: H_{n, 1} = H_n = \sum_{k=1}^n \frac{1}{k}. The limit of H_{n, m} as is finite if , with the generalized harmonic number bounded by and converging to the
Riemann zeta function \lim_{n\rightarrow \infty} H_{n,m} = \zeta(m). The smallest natural number
k such that
kn does not divide the denominator of generalized harmonic number
H(
k,
n) nor the denominator of alternating generalized harmonic number
H′(
k,
n) is, for
n=1, 2, ... : :77, 20, 94556602, 42, 444, 20, 104, 42, 76, 20, 77, 110, 3504, 20, 903, 42, 1107, 20, 104, 42, 77, 20, 2948, 110, 136, 20, 76, 42, 903, 20, 77, 42, 268, 20, 7004, 110, 1752, 20, 19203, 42, 77, 20, 104, 42, 76, 20, 370, 110, 1107, 20, ... The related sum \sum_{k=1}^n k^m occurs in the study of
Bernoulli numbers; the harmonic numbers also appear in the study of
Stirling numbers. Some integrals of generalized harmonic numbers are \int_0^a H_{x,2} \, dx = a \frac {\pi^2}{6}-H_{a} and \int_0^a H_{x,3} \, dx = a A - \frac {1}{2} H_{a,2}, where
A is
Apéry's constant ζ(3), and \sum_{k=1}^n H_{k,m}=(n+1)H_{n,m}- H_{n,m-1} \text{ for } m \geq 0 . Every generalized harmonic number of order
m can be written as a function of harmonic numbers of order m-1 using H_{n,m} = \sum_{k=1}^{n-1} \frac {H_{k,m-1}}{k(k+1)} + \frac {H_{n,m-1}}{n} for example: H_{4,3} = \frac {H_{1,2}}{1 \cdot 2} + \frac {H_{2,2}}{2 \cdot 3} + \frac {H_{3,2}}{3 \cdot 4} + \frac {H_{4,2}}{4} A
generating function for the generalized harmonic numbers is \sum_{n=1}^\infty z^n H_{n,m} = \frac {\operatorname{Li}_m(z)}{1-z}, where \operatorname{Li}_m(z) is the
polylogarithm, and . The generating function given above for is a special case of this formula. A
fractional argument for generalized harmonic numbers can be introduced as follows: For every p,q>0 integer, and m>1 integer or not, we have from polygamma functions: H_{q/p,m}=\zeta(m)-p^m\sum_{k=1}^\infty \frac{1}{(q+pk)^m} where \zeta(m) is the
Riemann zeta function. The relevant recurrence relation is H_{a,m}=H_{a-1,m}+\frac{1}{a^m}. Some special values are\begin{align} H_{\frac{1}{4},2} &= 16-\tfrac{5}{6}\pi^2 -8G\\ H_{\frac{1}{2},2} &= 4-\frac{\pi^2}{3} \\ H_{\frac{3}{4},2} &= \frac{16}{9}-\frac{5}{6}\pi^2 + 8G \\ H_{\frac{1}{4},3} &= 64-\pi^3-27\zeta(3) \\ H_{\frac{1}{2},3} & =8-6\zeta(3) \\ H_{\frac{3}{4},3} &= \left(\frac{4}{3}\right)^3+\pi^3 -27\zeta(3) \end{align}where
G is
Catalan's constant. In the special case that p = 1, we get H_{n,m}=\zeta(m, 1) - \zeta(m, n+1), where \zeta(m, n) is the
Hurwitz zeta function. This relationship is used to calculate harmonic numbers numerically.
Multiplication formulas The
multiplication theorem applies to harmonic numbers. Using
polygamma functions, we obtain \begin{align} H_{2x} & =\frac{1}{2}\left(H_x+H_{x-\frac{1}{2}}\right)+\ln 2 \\ H_{3x} &= \frac{1}{3}\left(H_x+H_{x-\frac{1}{3}}+H_{x-\frac{2}{3}}\right)+\ln 3, \end{align} or, more generally, H_{nx}=\frac{1}{n}\left(H_x+H_{x-\frac{1}{n}}+H_{x-\frac{2}{n}}+\cdots +H_{x-\frac{n-1}{n}} \right) + \ln n. For generalized harmonic numbers, we have \begin{align} H_{2x,2} &= \frac{1}{2}\left(\zeta(2)+\frac{1}{2}\left(H_{x,2}+H_{x-\frac{1}{2},2}\right)\right) \\ H_{3x,2} &= \frac{1}{9}\left(6\zeta(2)+H_{x,2}+H_{x-\frac{1}{3},2}+H_{x-\frac{2}{3},2}\right), \end{align} where \zeta(n) is the
Riemann zeta function.
Hyperharmonic numbers The next generalization was discussed by
J. H. Conway and
R. K. Guy in their 1995 book
The Book of Numbers. named after
Steven Roman, were introduced by
Daniel Loeb and
Gian-Carlo Rota in the context of a generalization of
umbral calculus with logarithms. There are many possible definitions, but one of them, for n,k \geq 0, is c_n^{(0)} = 1, and c_n^{(k+1)} = \sum_{i=1}^n\frac{c_i^{(k)}}{i}. Of course, c_n^{(1)} = H_n. If n \neq 0, they satisfy c_n^{(k+1)} - \frac{c_n^{(k)}}{n} = c_{n-1}^{(k+1)}. Closed form formulas are c_n^{(k)} = n! (-1)^k s(-n,k), where s(-n,k) is
Stirling numbers of the first kind generalized to negative first argument, and c_n^{(k)} = \sum_{j=1}^n \binom{n}{j} \frac{(-1)^{j-1}}{j^k}, which was found by
Donald Knuth. In fact, these numbers were defined in a more general manner using Roman numbers and
Roman factorials, that include negative values for n. This generalization was useful in their study to define
Harmonic logarithms. ==Harmonic numbers for real and complex values==