{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "07TZV87Y0T"
    },
    {
      "field": "instance_of",
      "target": "0906Z03EMN"
    }
  ],
  "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": "f591989ed15704e9d8755a7a5a6426d73de7a3ae",
  "front": {
    "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://math2.tamnd.com/node/0FYX44GP92/",
  "links": null,
  "markdown": "https://math2.tamnd.com/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://math2.tamnd.com/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
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}