{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "07TZV87Y0T"
    },
    {
      "field": "instance_of",
      "target": "0906Z03EMN"
    },
    {
      "field": "specializes",
      "target": "0NDVHBVBXB"
    },
    {
      "field": "specializes",
      "target": "7C7FBZGERM"
    },
    {
      "field": "specializes",
      "target": "8Y28JQB0Q5"
    },
    {
      "field": "specializes",
      "target": "9VA6P5KQQT"
    },
    {
      "field": "specializes",
      "target": "AA7XRZ4VAG"
    },
    {
      "field": "specializes",
      "target": "K6QV4WSTXX"
    },
    {
      "field": "uses",
      "target": "1W4X6J3948"
    },
    {
      "field": "uses",
      "target": "1YADG8ESHY"
    },
    {
      "field": "uses",
      "target": "476ZQPMZHP"
    },
    {
      "field": "uses",
      "target": "NWGARTY61Y"
    },
    {
      "field": "uses",
      "target": "RWNTZ2AYA7"
    },
    {
      "field": "uses",
      "target": "VZ1J7KM4QS"
    },
    {
      "field": "uses",
      "target": "WTXMRG6WR4"
    },
    {
      "field": "uses",
      "target": "YRYWCP9TYV"
    },
    {
      "field": "about",
      "target": "1YADG8ESHY"
    },
    {
      "field": "about",
      "target": "476ZQPMZHP"
    },
    {
      "field": "about",
      "target": "VZ1J7KM4QS"
    },
    {
      "field": "about",
      "target": "YRYWCP9TYV"
    }
  ],
  "body": "\n## Summary\n\nA recurrence relation defines each term of a sequence from earlier terms. Recurrences are a main tool to describe counting sequences, and solving one means finding a closed formula for its terms. The node [[recurrence relation|07TZV87Y0T]] gives the precise definition.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "inventory": [
      "3CNF1DE7TD"
    ],
    "kind": "concept",
    "msc": [
      "39A05"
    ],
    "name": "Recurrence relation",
    "same_as": {
      "wikidata": "Q740970",
      "wikipedia": "Recurrence relation"
    },
    "sources": [
      {
        "locator": "Definition",
        "url": "https://en.wikipedia.org/wiki/Recurrence_relation"
      }
    ],
    "tag": "0FYX44GP92"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/0FYX44GP92/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/0FYX44GP92.md",
  "msc": [
    "39A05"
  ],
  "name": "Recurrence relation",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0FY/0FYX44GP92.md",
  "status": null,
  "tag": "0FYX44GP92",
  "uri": "m2://0FYX44GP92",
  "url": "https://tamnd.github.io/math2/wiki/recurrence-relation/",
  "writing": {
    "tag": "0FYX44GP92",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 1,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      }
    ]
  }
}
