Catalan number¶

The integer sequence C_n=(1/(n+1)) binomial(2n,n) that counts many recursively nested structures such as balanced parentheses, polygon triangulations and binary trees.

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

Core Idea¶

Catalan numbers are a canonical enumerative sequence shared by many equinumerous combinatorial classes. A distinguished root or first-return decomposition splits an object into two smaller Catalan objects, producing the convolution recurrence and algebraic generating function. 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.

The load-bearing residual is not the broad topic of enumerative combinatorics. It is The integer sequence C_n=(1/(n+1)) binomial(2n,n) that counts many recursively nested structures such as balanced parentheses, polygon triangulations and binary trees.

How would you explain it like I'm…

The Nesting Numbers

How many ways can you close a bunch of open parentheses so they match up properly? With one pair there's 1 way, with two pairs 2 ways, with three pairs 5 ways. Those counting numbers are the Catalan numbers, and they also count lots of other puzzles built from smaller pieces nested inside each other.

Nested-Pattern Counters

The Catalan numbers are a list of counting numbers: 1, 1, 2, 5, 14, 42, and so on. They answer many different puzzles that all turn out to have the same answer. For example, they count how many ways you can write n pairs of parentheses so every open one is closed properly, and how many ways you can cut a many-sided shape into triangles using lines between corners. The reason they show up so often is that each of these objects can be split at one special spot into two smaller objects of the same kind. That splitting lets you build the next number from the earlier ones.

Counting Nested Structures

The Catalan numbers are the sequence C_n = (1/(n+1)) × (2n choose n): 1, 1, 2, 5, 14, 42, … They count many different families of recursively nested objects of size n, such as balanced strings of n pairs of parentheses, triangulations of a polygon with n + 2 sides, and binary trees with n internal nodes. These families are equinumerous — each size has the same count — because each object can be split at a distinguished point (like the first place a bracket string returns to balance) into two smaller objects of the same type. That split gives the recurrence C_{n+1} = C_0·C_n + C_1·C_{n−1} + … + C_n·C_0. To claim something is counted by Catalan numbers, you must pin down the indexing and prove the exact count, for example by a matching (bijection) or by that recurrence.

The Catalan numbers C_n = (1/(n+1))·binom(2n, n) form a canonical enumerative sequence shared by many equinumerous combinatorial classes: Dyck words (balanced parentheses) of semilength n, triangulations of a convex (n+2)-gon, full binary trees with n internal nodes, and more. The structural reason is a root or first-return decomposition: removing a distinguished element splits an object of size n+1 into an ordered pair of smaller Catalan objects whose sizes sum to n. This yields the convolution recurrence C_{n+1} = Σ_{i=0}^{n} C_i C_{n−i} with C_0 = 1, and hence an algebraic generating function satisfying C(x) = 1 + x·C(x)². Establishing that a new class is Catalan requires fixing the indexing convention (off-by-one shifts are common) and giving a bijection to a known class or verifying the recurrence and initial condition. Resemblance to nested structure is not enough; the count must be exactly C_n.

Scope of Application¶

Catalan number belongs to enumerative combinatorics and is useful where the analyst can specify nonnegative index n, Catalan integer C_n, binomial formula, recurrence, generating function and families of objects with recursive binary decomposition, then evaluate the indexing convention and bijection or recurrence establish the exact nth Catalan count. The scope is broad within that domain but bounded by the need for the indexing convention and bijection or recurrence establish the exact nth Catalan count. 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 indexing convention and bijection or recurrence establish the exact nth Catalan count 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 Catalan 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 Catalan number. Catalan 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: nonnegative index n, Catalan integer C_n, binomial formula, recurrence, generating function and families of objects with recursive binary decomposition. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the indexing convention and bijection or recurrence establish the exact nth Catalan count independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of enumerative combinatorics because they reuse nonnegative index n, Catalan integer C_n, binomial formula, recurrence, generating function and families of objects with recursive binary decomposition, A distinguished root or first-return decomposition splits an object into two smaller Catalan objects, producing the convolution recurrence and algebraic generating function., and type the carrier, state every parameter and convention in the definition, test that the indexing convention and bijection or recurrence establish the exact nth Catalan count, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Catalan number Domain-specific

Parents (1) — outgoing typed relations

Catalan number is a kind of Recurrence Prime

The candidate literally instantiates prime:recurrence.

Hierarchy path (1) — routes to 1 parentless root

Catalan number → is a kind of Recurrence

Neighborhood in Abstraction Space¶

Catalan number sits in a crowded region of the domain-specific corpus (18^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