Fibonacci

A000045

Under OEIS <a href="https://oeis.org/A000045">A000045</a>, the nth Fibonnaci number is given as
$$F_n = F_{n-1} + F_{n-2}$$
where the first 6 entries are 0, 1, 1, 2, 3, 5 with $n\ge 0.$

Generates well-known integer sequences. 'gmp' package is adopted for computing with arbitrarily large numbers. Every function has hyperlink to its corresponding item in OEIS (The On-Line Encyclopedia of Integer Sequences) in the function help page. For interested readers, see Sloane and Plouffe (1995, ISBN:978-0125586306).

Kisung You

Zseq

Integer Sequence Generator

Fibonacci function

<dl><dt>n</dt>
<dd>the number of first <code>n</code> entries from the sequence.</dd>
<dt>gmp</dt>
<dd>a logical; <code>TRUE</code> to use large number representation, <code>FALSE</code> otherwise (default: <code>TRUE</code>).</dd></dl>

Arguments

Under OEIS <a href='https://oeis.org/A000045'>A000045</a>, the nth Fibonnaci number is given as
$$F_n = F_{n-1} + F_{n-2}$$
where the first 6 entries are 0, 1, 1, 2, 3, 5 with $n\ge 0.$

Fibonacci numbers — Fibonacci

<dl>

<dt>n</dt>
<dd>the number of first <code>n</code> entries from the sequence.</dd>


<dt>gmp</dt>
<dd>a logical; <code>TRUE</code> to use large number representation, <code>FALSE</code> otherwise (default: <code>TRUE</code>).</dd>

</dl>

Fibonacci: Fibonacci numbers

Description

Usage

Value

Arguments

Examples