Listing 7. A Fibonacci sequence in fib.hs.
清单7. fib . hs中的Fibonacci序列。
We first get the infinite Fibonacci sequence.
我们首先获得一个无穷的Fibonacci序列。
Here the Fibonacci Outgrowth is represented.
这里体现了斐波纳契数列结果。
I am testing different Fibonacci patterns now.
现在我正在测试其它的斐波那契枝叶布局模式。
The font size also corresponds to a Fibonacci number.
字体的大小也对应于一个斐波那契数。
Figure 4 shows the Fibonacci trace highlighted in vim.
图4显示了vim中加亮的Fibonacci跟踪。
Your first Erlang program, a recursive Fibonacci function.
第一个Erlang程序，一个递归的fibonacci函数。
Why are there different Fibonacci patterns among trees?
为什么不同的树种中有不同的斐波那契布局模式存在？
He then applies this to the Fibonacci sequence generator.
他接下来将这个函数应用在斐波那契数列生成器上。
A Fibonacci design is best suited to blogs and magazine layouts.
斐波那契设计最适宜用于博客和杂志页面布局。
A Fibonacci spiral, which is a close approximation of a golden spiral.
斐波那契螺旋是黄金螺旋线的近似表达。
The example he USES is a function that generates a Fibonacci sequence.
他当时使用的例子，就是用递归生成一个斐波那契数列。
The result -- the 16th element in the Fibonacci series -- is shown in Figure 2.
其结果 ——Fibonacci系列的第 16 个元素 ——如图 2 所示。
You can arrange the layout in different ways according to Fibonacci Numbers.
你可以根据斐波那契序列的数字来安排不同的页面布局方式。
Now that we have a good way to generate Fibonacci numbers, let's solve the problem.
我们已经具备了一种很好的生成Fibonacci数的方式，让我们来解决这个问题。
While counting his newborn rabbits, Fibonacci came up with a numerical sequence.
斐波那契提出了一个数字序列计数新生兔子。
Only one sheriff wasn’t in his office, so that had to be the one guarding Fibonacci.
只有一位警长不在办公室里，所以可以肯定是他在守卫Fibonacci。
Each new term in the Fibonacci sequence is generated by adding the previous two terms.
Fibonacci序列中的每个新的项都是其前面两项相加的结果。
I designed and built my own test model, copying the Fibonacci pattern of an oak tree.
模仿橡树的斐波那契布局模式，我设计并制作了自己的测试模型。
We prepared a sample PSD layout that is designed according to the Fibonacci sequence.
我们准备了遵照斐波那契序列原则设计的PSD格式版面设计示例。
The first time that fibonacci(35) was called, it took 106.857 milliseconds to execute.
第一次调用 fibonacci(35)时，执行的时间是 106.857毫秒。
The Fibonacci pattern allowed some solar panels to collect sunlight even if others were in shade.
即使在被遮挡的情况下，斐波那契布局模式让部分太阳能电池仍然能够收集到阳光。
Nobody in their right mind actually implements a recursive Fibonacci the way I did it originally.
没有谁真的在右脑中，按我最初讲的递归方法，计算Fibonacci数列。
When it comes to mathmatics, you do not need to stick to well-known Golden Ratio or Fibonacci sequence.
当谈到数学时，你无需遵循众所周知的黄金分割比率和斐波那契序列。
The amazing thing is that the mathematical fractions were the same numbers as the Fibonacci sequence!
令人惊讶的是这些分数的构成数字正是组成斐波那契数列的数字。
So I was testing the Fibonacci pattern under the most difficult circumstances for collecting sunlight.
因此我是在最不容易收集太阳光的环境下进行的斐波那契布局测试。
So the first two Fibonacci Numbers are given, and each remaining number is the sum of the previous two.
因此斐波那契数列的头两项数字是给定的，而之后的每个数字是前两项数字之和。
Fibonacci Numbers at least have the virtue of creating a testable proposition; one that they appear to fail.
斐波纳契数的优点在于至少有可测试的主张；一个看起来错了的主张。
Fibonacci Numbers at least have the virtue of creating a testable proposition; one that they appear to fail.
斐波纳契数的优点在于至少有可测试的主张；一个看起来错了的主张。
应用推荐