Statements (51)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer sequence
|
| gptkbp:alsoKnownAs |
gptkb:Fibonacci_numbers
|
| gptkbp:appearsIn |
nature
|
| gptkbp:application |
gptkb:architecture
gptkb:art gptkb:mathematics biology computer algorithms |
| gptkbp:first_terms |
0
1 |
| gptkbp:form |
gptkb:Binet's_formula
|
| https://www.w3.org/2000/01/rdf-schema#label |
Fibonacci Sequence
|
| gptkbp:introducedIn |
gptkb:Liber_Abaci
1202 |
| gptkbp:namedAfter |
gptkb:Leonardo_of_Pisa
|
| gptkbp:OEIS |
gptkb:A000045
|
| gptkbp:property |
appears in mathematical puzzles
appears in number theory appears in recreational mathematics appears in continued fractions appears in arrangement of leaves appears in arrangement of pine cones appears in branching of trees appears in family tree of honeybees appears in flowering of artichoke appears in fruit sprouts of a pineapple appears in phyllotaxis appears in Pascal's triangle appears in spiral patterns each number is the sum of the two preceding ones appears in coding theory appears in combinatorial problems appears in computer science appears in cryptography appears in data structures appears in dynamic programming appears in financial markets appears in fractals appears in geometry appears in music theory appears in population growth models appears in recursive algorithms appears in search algorithms appears in tiling problems ratio of successive terms approaches golden ratio sum of first n Fibonacci numbers is F(n+2) - 1 sum of squares of first n Fibonacci numbers is F(n) * F(n+1) |
| gptkbp:recurrence |
F(n) = F(n-1) + F(n-2)
|
| gptkbp:relatedTo |
gptkb:golden_ratio
|
| gptkbp:bfsParent |
gptkb:Dynamic_Programming
|
| gptkbp:bfsLayer |
6
|