---
tag: G0N21JRK2P
kind: concept
name: Schröder–Hipparchus number
aliases: [little-schroder-number, schroeder-hipparchus-number, small-schroder-number, super-catalan-number]
sources:
  - wikipedia: en:33490570@r1353875949
    locator: Schröder–Hipparchus number
    note: adopted
    mention: wikipedia://en/33490570
    sections: [Summary]
same_as:
  wikidata: Q15264444
  wikipedia: Schröder–Hipparchus number
inventory: [QQCVFKK3TQ]
---

## Summary

In [[combinatorics|0JKW7W7XFR]], the **Schröder–Hipparchus numbers** form an integer sequence that can be used to count the [[plane trees|062D9KXJB1]] 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