Hyperharmonic number¶

A recursively iterated family of partial sums beginning with reciprocals and extending the ordinary harmonic numbers by an order parameter.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4938
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Enumerative Combinatorics → Mathematics

Core Idea¶

The hyperharmonic number of order zero is one over n, and each positive order is obtained by summing all lower-order values through n; equivalent formulas use binomial coefficients, harmonic numbers, and r-Stirling numbers. Repeated discrete summation raises the polynomial-logarithmic growth order and induces recurrences and generating functions linking the numbers to permutation enumeration. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Add-It-Up-Again Fractions

Start with a list of fractions: 1, then one half, then one third, and so on. Make a new list where each spot is the total of everything so far. Then do the same thing again to that new list, and again. The numbers you get by adding up again and again are hyperharmonic numbers.

Running Totals of Running Totals

Begin with the fractions 1, 1/2, 1/3, 1/4, … These are the hyperharmonic numbers of order zero, where the nth one is 1/n. To get order one, add up the order-zero numbers from the first up to the nth, giving 1, 1 + 1/2, 1 + 1/2 + 1/3, and so on. To get order two, keep running totals of the order-one numbers. Every new order is the running totals of the order before. The numbers grow faster with each new order.

Iterated Harmonic Sums

Hyperharmonic numbers are defined recursively. Order zero is 1/n. For each positive order r, the value at n is the sum of the order r−1 values for positions 1 through n. So order one gives the ordinary harmonic numbers 1 + 1/2 + … + 1/n, and higher orders are repeated running sums. There are equivalent formulas using binomial coefficients, harmonic numbers and r-Stirling numbers. Repeated summation increases the growth rate, and the numbers connect to counting permutations. To use them correctly you must agree on the base case, order, summation limits and indexing.

A Hyperharmonic number of order r at index n is obtained by iterated discrete summation. The base case sets the order-zero value to 1/n, and for r ≥ 1 the order-r value at n is the sum of the order-(r−1) values from 1 to n. Order one recovers the harmonic numbers. Closed forms express the general case through binomial coefficients and harmonic numbers, and r-Stirling numbers give another equivalent description. Each summation step raises the polynomial-logarithmic growth order. The definition also induces recurrences and generating functions that link the numbers to permutation enumeration. Because conventions vary, any claim should check that the base case, positive integer order, summation limits and indexing agree with the recursive definition, rather than assuming a similarly named sequence.

Scope of Application¶

Hyperharmonic number belongs to enumerative combinatorics and is useful where the analyst can specify the typed enumerative combinatorics carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the base case, positive integer order, summation limits, and indexing convention agree with the recursive definition. The scope is broad within that domain but bounded by the need for the base case, positive integer order, summation limits, and indexing convention agree with the recursive definition. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the base case, positive integer order, summation limits, and indexing convention agree with the recursive definition the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Hyperharmonic number can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Hyperharmonic number. Hyperharmonic number compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed enumerative combinatorics carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the base case, positive integer order, summation limits, and indexing convention agree with the recursive definition independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of enumerative combinatorics because they reuse the typed enumerative combinatorics carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Repeated discrete summation raises the polynomial-logarithmic growth order and induces recurrences and generating functions linking the numbers to permutation enumeration., and type the carrier, state every parameter and convention in the definition, test that the base case, positive integer order, summation limits, and indexing convention agree with the recursive definition, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Hyperharmonic number Domain-specific

Parents (1) — outgoing typed relations

Hyperharmonic number is a kind of Recursion Prime

What makes it its own entry: the domain-specific identity determined by the base case, positive integer order, summation limits, and indexing convention agree with the recursive definition.

Hierarchy path (1) — routes to 1 parentless root

Hyperharmonic number → is a kind of Recursion

Neighborhood in Abstraction Space¶

Hyperharmonic number sits in a crowded region of the domain-specific corpus (7^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Combinatorial Enumeration & Sequences (38 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25