bn:00722181n
Noun Concept
Categories: Integer sequences, Enumerative combinatorics
EN
Schröder number  Schroder number  Schroeder number
EN
In mathematics, the Schröder number S n, {\displaystyle S_{n},} also called a large Schröder number or big Schröder number, describes the number of lattice paths from the southwest corner {\displaystyle } of an n × n {\displaystyle n\times n} grid to the northeast corner, {\displaystyle,} using only single steps north, ; {\displaystyle ;} northeast, ; {\displaystyle ;} or east,, {\displaystyle,} that do not rise above the SW–NE diagonal. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, the Schröder number S n, {\displaystyle S_{n},} also called a large Schröder number or big Schröder number, describes the number of lattice paths from the southwest corner {\displaystyle } of an n × n {\displaystyle n\times n} grid to the northeast corner, {\displaystyle,} using only single steps north, ; {\displaystyle ;} northeast, ; {\displaystyle ;} or east,, {\displaystyle,} that do not rise above the SW–NE diagonal. Wikipedia
The number of possible lattice paths from the southwest corner (0, 0) of an n × n grid to the northeast corner (n, n), using only single steps north, northeast or east, and not rising above the southwest–northeast diagonal. Wiktionary
IS A
Wikipedia
Wikidata
Wiktionary
Wikipedia Redirections