Jump to content

Integer sequence

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Poslfit (talk | contribs) at 21:36, 3 January 2002 (*Sequences may be finite, deleted 'infinite'.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

An integer sequence is a sequence (i.e. an ordered list) of integers.


An integer sequence may be specified explicitly by giving a formula for its n-th term, or implicitly by giving a relationship between its terms. For example, the sequence 1, 1, 2, 3, 5, 8, 13, ... (the Fibonacci sequence) is formed by starting with two ones and then adding any two consecutive terms to obtain the next term. The sequence 0, 3, 8, 15, ... is formed according to the formula n2 - 1 for the n-th, or general, term.


Information about thousands of integer sequences is recorded in Neil Sloane's Encyclopedia of Integer Sequences, online at http://www.research.att.com/~njas/sequences/Seis.html.




/Talk