Catalan number
Catalan number is a recursive integer sequence.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2542394966
- Described as
- recursive integer sequence
- Other names
- Segner number
- Named after
- Eugène Charles Catalan
- Wikipedias with a page
- 42
Wikidata item Q270513 (wikidata.org/wiki/Q270513), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1386225524
First,
In mathematics, the Catalan numbers are a sequence of natural numbers that occur in various counting problems, often involving recursively defined objects. They are named after Eugène Catalan, though they were previously discovered in the 1730s by Minggatu.
The n-th Catalan number can be expressed directly in terms of central binomial coefficients by
Cn=1n+1(2nn)=(2n)!(n+1)!n!for n≥0.
The first few Catalan numbers are1,1,2,5,14,42,132,429,1430,4862,16796,58786,…
(sequence A000108 in the OEIS).
From the Wikipedia article “Catalan number” (en.wikipedia.org/wiki/Catalan_number), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
Picture: Wikimedia Commons: Catalan 4 leaves binary tree example.svg · See Commons file page
