{
  "aliases": [
    "lah-numbers",
    "unsigned-lah-number"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn mathematics, the (**signed and unsigned**) **Lah numbers** are coefficients expressing rising factorials in terms of falling factorials and vice versa. They were discovered by Ivo Lah in 1954. Explicitly, the unsigned Lah numbers $L(n, k)$ are given by the formula involving the [[binomial coefficient|092GEF38YD]]\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "lah-numbers",
      "unsigned-lah-number"
    ],
    "inventory": [
      "SCQMJSK188"
    ],
    "kind": "concept",
    "name": "Lah number",
    "same_as": {
      "wikidata": "Q451829",
      "wikipedia": "Lah number"
    },
    "sources": [
      {
        "locator": "Lah number",
        "mention": "wikipedia://en/85752",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:85752@r1375382536"
      }
    ],
    "tag": "5WG7MPH4ZD"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/5WG7MPH4ZD/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/5WG7MPH4ZD.md",
  "msc": null,
  "name": "Lah number",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/5WG/5WG7MPH4ZD.md",
  "status": null,
  "tag": "5WG7MPH4ZD",
  "uri": "m2://5WG7MPH4ZD",
  "url": "https://math2.tamnd.com/wiki/lah-number/",
  "writing": {
    "tag": "5WG7MPH4ZD",
    "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
      }
    ]
  }
}
