find fibonacci

Find a cone from a conifer tree and look at it from the bottom. Count the number of spirals going from the center of the cone (where it attached to the tree) to the outside edge. Count the spirals in both directions. The resulting numbers are usually two consecutive Fibonacci (FEE-buh-NAW-chee) numbers (e.g., 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, . . .). In the example shown, there are 8 clockwise spirals and 13 counter-clockwise spirals. Can you find a cone that doesn’t follow this pattern?