Schröder number
Schröder number is a mathematical integer sequence.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 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 2440463969
- Described as
- mathematical integer sequence
- What it is
- integer sequence; mathematical concept
- Wikipedias with a page
- 11
Wikidata item Q2071909 (wikidata.org/wiki/Q2071909), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1383324348
In mathematics, the Schröder number Sn, also called a large Schröder number or big Schröder number, describes the number of lattice paths from the southwest corner (0,0) of an n×n grid to the northeast corner (n,n), using only single steps north, (0,1); northeast, (1,1); or east, (1,0), that do not rise above the SW–NE diagonal.
The first few Schröder numbers are1, 2, 6, 22, 90, 394, 1806, 8558, ... (sequence A006318 in the OEIS).
where S0=1 and S1=2. They were named after the German mathematician Ernst Schröder.
From the Wikipedia article “Schröder number” (en.wikipedia.org/wiki/Schröder_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.
