Padovan

A000931

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

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

Padovan 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.</dd></dl>

Arguments

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

Padovan numbers — Padovan

<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.</dd>

</dl>

Padovan: Padovan numbers

Description

Usage

Value

Arguments

Examples