# Fibonacci
> Compute the nth [Fibonacci number][fibonacci-number].
The [Fibonacci numbers][fibonacci-number] are the integer sequence
The sequence is defined by the recurrence relation
with seed values `F_0 = 0` and `F_1 = 1`.
## Usage
```javascript
var fibonacci = require( '@stdlib/math/base/special/fibonacci' );
```
#### fibonacci( n )
Computes the nth [Fibonacci number][fibonacci-number].
```javascript
var v = fibonacci( 0 );
// returns 0
v = fibonacci( 1 );
// returns 1
v = fibonacci( 2 );
// returns 1
v = fibonacci( 3 );
// returns 2
v = fibonacci( 78 );
// returns 8944394323791464
```
If `n > 78`, the function returns `NaN`, as larger [Fibonacci numbers][fibonacci-number] cannot be safely represented in [double-precision floating-point format][ieee754].
```javascript
var v = fibonacci( 79 );
// returns NaN
```
If not provided a nonnegative integer value, the function returns `NaN`.
```javascript
var v = fibonacci( 3.14 );
// returns NaN
v = fibonacci( -1 );
// returns NaN
```
If provided `NaN`, the function returns `NaN`.
```javascript
var v = fibonacci( NaN );
// returns NaN
```
## Examples
```javascript
var fibonacci = require( '@stdlib/math/base/special/fibonacci' );
var v;
var i;
for ( i = 0; i < 79; i++ ) {
v = fibonacci( i );
console.log( v );
}
```
[fibonacci-number]: https://en.wikipedia.org/wiki/Fibonacci_number
[ieee754]: https://en.wikipedia.org/wiki/IEEE_754-1985
