scientific article; zbMATH DE number 2124065

From MaRDI portal
Publication:4831463





The harmonic numbers are defined as \(H_n=\sum_{k=1}^n 1/k\). It is well-known that \(H_n={n+1 \brack 2} /n!\), where \({n \brack k}\) denotes the (signless) Stirling number of the first kind, which counts the permutations of \(n\) elements with exactly \(k\) cycles. The hyperharmonic numbers \(H_n^r\) are defined recursively from \(H_n^0=1/n\) by \( H_n^r=\sum_{k=1}^n H_k^{r-1}\). Clearly \(H_n^1=H_n\). The paper gives two combinatorial results regarding \(H_n^r\). The first is about writing \(H_n^r\) as a sum fractions of type \(1/t\) \((1\leq t\leq n)\) according to working out \(H_n^r\) from \(H_n^1\) using the recursive definition. Then, the number of \(1/t\) terms is \({n+r-t-1\choose r-1}\). The other result is \(H_n^r={n+r \brack r+1}_r /n!\), where \({n \brack k}_r\) is the \(r\)-Stirling number, the number of \(n\) elements with exactly \(k\) cycles, where pairs of some \(r\) elements are not allowed to be in the same cycle.




Cited in
(50)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4831463)