Fibonacci sequence
entire infinite integer series where the next number is the sum of the two preceding it (0,1,1,2,3,5,8,13,21,...)
Press Enter · cited answer in seconds
0 sources
Fibonacci sequence
Summary
Fibonacci sequence is a constant-recursive sequence[1]. It has Wikipedia articles in 23 language editions, a strong signal of global cultural recognition.[2]
Key Facts
- Fibonacci sequence's instance of is recorded as constant-recursive sequence[3].
- Fibonacci sequence's instance of is recorded as Lucas sequence[4].
- Fibonacci sequence's instance of is recorded as divisibility sequence[5].
- Fibonacci is named after Fibonacci sequence[6].
- Fibonacci sequence is part of Pascal's triangle[7].
- Fibonacci sequence's Commons category is recorded as Fibonacci numbers[8].
- Fibonacci sequence's described by source is recorded as The Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd edition[9].
- Fibonacci sequence's studied by is recorded as Theory of Fibonacci Numbers[10].
- Fibonacci sequence's has part is recorded as Fibonacci number[11].
- Fibonacci sequence's maintained by WikiProject is recorded as WikiProject Mathematics[12].
Body
Definition and Type
Recorded instance of include constant-recursive sequence[3], Lucas sequence[4], and divisibility sequence[5].
Origins
Fibonacci is named after Fibonacci sequence[6].
Use and Application
Fibonacci sequence is part of Pascal's triangle[7].
Influence
Things named for Fibonacci sequence include Fibonacci coding[13], a mixed radix numerical system[14].
Why It Matters
Fibonacci sequence has Wikipedia articles in 23 language editions, a strong signal of global cultural recognition.[2] It is known by 51 alternative names across languages and contexts.[15]
Entities named for it include Fibonacci coding[13], a mixed radix numerical system[14].