斐波那契计算器
生成斐波那契数列
公式
F(n) = F(n-1) + F(n-2)
Each number is the sum of the two preceding ones.
示例
F(10)
= 55
常见问题
关于 斐波那契计算器
Generate Fibonacci numbers and explore the golden ratio.
生成斐波那契数列
Each number is the sum of the two preceding ones.
= 55
Generate Fibonacci numbers and explore the golden ratio.