# Fibonacci ( n )

Formula calculation of the number at n in the Fibonacci sequence. No recursion.

Average rating: 4.4 (38 votes) Log in to vote

Steve Allen Richard Carlton Consulting, Inc. http://www.rcconsulting.com |

Sample input:

Fibonacci ( 11 )

Sample output:

89

Function definition: (Copy & paste into FileMaker's Edit Custom Function window)

Simple Calculation (and fast!) of the number at n in the Fibonacci sequence.

Does not require recursion.

As described here: http://en.wikipedia.org/wiki/Fibonacci_number

(accessed 1/30/2009, 12:00 p.m.)

## Comments

Note: these functions are not guaranteed or supported by BrianDunning.com. Please contact the individual developer with any questions or problems.