Using Fn-2 = Fn - Fn-1, one can extend the Fibonacci numbers to negative integers. So we get: ...

-8, 5, -3,
n
2, -1, 1, 0, 1, 1, 2, 3, 5, 8, ... and F-n = -(-1) Fn.

Tribonacci numbers[edit]
The tribonacci numbers are like the Fibonacci numbers, but instead of starting with two predetermined
terms, the sequence starts with three predetermined terms and each term afterwards is the sum of the
preceding three terms. The first few tribonacci numbers are

Tetranacci numbers[edit]
The tetranacci numbers start with four predetermined terms, each term afterwards being the sum of the
preceding four terms. The first few tetranacci numbers are:
0, 0, 0, 1, 1, 2, 4, 8, 15, 29, 56, 108, 208, 401, 773, 1490, 2872, 5536, 10671, 20569, 39648,
76424, 147312, 283953, 547337, (sequence A000078 in OEIS)
The tetranacci constant is the ratio toward which adjacent tetranacci numbers tend. It is a root of
4
3
2
the polynomial x x x x 1, approximately 1.92756 A086088, and also satisfies the
4
equation x + x = 2.
Pentanacci, hexanacci, and heptanacci numbers have been computed. The pentanacci numbers are:
0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 31, 61, 120, 236, 464, 912, 1793, 3525, 6930, 13624,

A001591

Hexanacci numbers:
0, 0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 32, 63, 125, 248, 492, 976, 1936, 3840, 7617, 15109,

A001592

Heptanacci numbers:
0, 0, 0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 32, 64, 127, 253, 504, 1004, 2000, 3984, 7936, 15808,
A122189
Octanacci numbers:
0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 32, 64, 128, 255, 509, 1016, 2028, 4048, 8080, 16128, ...
A079262
Nonacci numbers:
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 511, 1021, 2040, 4076, 8144, 16272,...
A104144
The limit of the ratio of successive terms of an n-nacci series tends to a root of the
equation

( A103814,

A118427,

A118428).

An alternate recursive formula for the limit of ratio r of two consecutive n-nacci

numbers can be expressed as

The special case n=2 is the traditional Fibonacci series yielding the golden

section