Binet’s Formula for the Tribonacci Sequence

W. R. Spickerman

˜The œFibonacci quarterly · 1982 · 76 citations · 2 references

Concepts

Abstract

The terms of a recursive sequence are usually defined by a recurrence pro-cedure; that is, any term is the sum of preceding terms. Such a definition might not be entirely satisfactory, because the computation of any term could require the computation of all of its predecessors. An alternative definition

References

2