# Fibonacci Sequence

**Formula:**`F(n) = F(n-1) + F(n-2)`

## Introduction to Fibonacci Sequence

The Fibonacci sequence is a series of numbers in which each number (Fibonacci number) is the sum of the two preceding ones, usually starting with 0 and 1. The sequence starts with 0 followed by 1, and each subsequent number is the sum of the previous two. This sequence is named after Leonardo of Pisa, known as Fibonacci, an Italian mathematician from the Middle Ages. The sequence often appears in various areas of mathematics and science, including biology, art, and computer algorithms.

## Parameter usage:

`n`

= the position in the Fibonacci sequence

## Example valid values:

`n`

= 5

## Output:

`F(n)`

= the nth number in the Fibonacci sequence

## Data validation

The number should be a non-negative integer.

## Summary

This calculator takes into account the position in the Fibonacci sequence and outputs the corresponding number. It is commonly used in various mathematical and applied settings.

Tags: Mathematics, Sequence, Fibonacci