Schröder–Hipparchus number
Summary
In combinatorics, the Schröder–Hipparchus numbers form an integer sequence that can be used to count the plane trees with a given set of leaves, the ways of inserting parentheses into a sequence, and the ways of dissecting a convex polygon into smaller polygons by inserting diagonals. These numbers begin
Further reading
- Wikipedia, page 33490570, revision 1353875949, Schröder–Hipparchus number. adopted
About this page
| Tag | G0N21JRK2P |
|---|---|
| URI | m2://G0N21JRK2P |
| Aliases | little-schroder-number, schroeder-hipparchus-number, small-schroder-number, super-catalan-number |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.