{
  "aliases": [
    "little-schroder-number",
    "schroeder-hipparchus-number",
    "small-schroder-number",
    "super-catalan-number"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn [[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\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "little-schroder-number",
      "schroeder-hipparchus-number",
      "small-schroder-number",
      "super-catalan-number"
    ],
    "inventory": [
      "QQCVFKK3TQ"
    ],
    "kind": "concept",
    "name": "Schröder–Hipparchus number",
    "same_as": {
      "wikidata": "Q15264444",
      "wikipedia": "Schröder–Hipparchus number"
    },
    "sources": [
      {
        "locator": "Schröder–Hipparchus number",
        "mention": "wikipedia://en/33490570",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:33490570@r1353875949"
      }
    ],
    "tag": "G0N21JRK2P"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/G0N21JRK2P/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/G0N21JRK2P.md",
  "msc": null,
  "name": "Schröder–Hipparchus number",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/G0N/G0N21JRK2P.md",
  "status": null,
  "tag": "G0N21JRK2P",
  "uri": "m2://G0N21JRK2P",
  "url": "https://math2.tamnd.com/wiki/schroder-hipparchus-number/",
  "writing": {
    "tag": "G0N21JRK2P",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}