{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "00CN2F997Q"
    },
    {
      "field": "uses",
      "target": "01WQZK97Z5"
    },
    {
      "field": "uses",
      "target": "0404D8TN7Y"
    },
    {
      "field": "uses",
      "target": "05DEJR6TGF"
    },
    {
      "field": "uses",
      "target": "0D0SMQYEJA"
    },
    {
      "field": "uses",
      "target": "0R9F850CTH"
    },
    {
      "field": "uses",
      "target": "0V4VB6MQDC"
    }
  ],
  "body": "\n## Example\n\nThe Fibonacci sequence $(F_n)_{n \\ge 0}$ is the sequence of natural numbers defined by\n$$F_0 = 0, \\qquad F_1 = 1, \\qquad F_{n+2} = F_{n+1} + F_n.$$\nIt is an example of a sequence defined by a [[recurrence relation|07TZV87Y0T]], and in particular of a [[linear recurrence with constant coefficients|081THG13JZ]].\nIts first terms are\n$$0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, \\dots$$\n\n## Remarks\n\nThe ratios $F_{n+1} / F_n$ tend to the [[golden ratio|0SC8T7548D]] $\\varphi = \\frac{1 + \\sqrt{5}}{2}$.\n[[Binet's formula|0404D8TN7Y]] gives $F_n$ in closed form.\n$F_{n+1}$ is the number of ways to tile a strip of length $n$ with squares of length $1$ and dominoes of length $2$.\n\n## Explanations\n\n### L1 human\n\nEach Fibonacci number is the sum of the two before it: $5 + 8 = 13$, $8 + 13 = 21$, and so on.\nThe numbers grow by a factor close to $1.618$ at each step.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "kind": "example",
    "msc": [
      "11B39"
    ],
    "name": "Fibonacci sequence",
    "same_as": {
      "wikidata": "Q23835349",
      "wikipedia": "Fibonacci sequence"
    },
    "sources": [
      {
        "locator": "Definition",
        "url": "https://en.wikipedia.org/wiki/Fibonacci_sequence"
      }
    ],
    "tag": "0GA9K57A39"
  },
  "kind": "example",
  "link": "https://math2.tamnd.com/node/0GA9K57A39/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/0GA9K57A39.md",
  "msc": [
    "11B39"
  ],
  "name": "Fibonacci sequence",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0GA/0GA9K57A39.md",
  "status": null,
  "tag": "0GA9K57A39",
  "uri": "m2://0GA9K57A39",
  "url": "https://math2.tamnd.com/wiki/fibonacci-sequence/",
  "writing": {
    "tag": "0GA9K57A39",
    "kind": "example",
    "level": "W0",
    "next": [
      {
        "what": "edge instance_of or not_instance_of or illustrates out",
        "have": 0,
        "want": 1
      }
    ]
  }
}