Integer sequence

related topics
{math, number, function}

In mathematics, 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 nth term, or implicitly by giving a relationship between its terms. For example, the sequence 0, 1, 1, 2, 3, 5, 8, 13, … (the Fibonacci sequence) is formed by starting with 0 and 1 and then adding any two consecutive terms to obtain the next one: an implicit description. The sequence 0, 3, 8, 15, … is formed according to the formula n2 − 1 for the nth term: an explicit definition.

Alternatively, an integer sequence may be defined by a property which members of the sequence possess and other integers do not possess. For example, we can determine whether a given integer is a perfect number, even though we do not have a formula for the nth perfect number.

Contents

Examples

Integer sequences which have received their own name include:

Full article ▸

related documents
Probability axioms
Krull dimension
Gauss–Legendre algorithm
Almost all
Senary
Catalan's constant
Prime ideal
Power associativity
Laurent polynomial
Leaf node
Self-similarity
Co-NP-complete
Church–Rosser theorem
Timeline of programming languages
HTML scripting
Measurable function
Two-out-of-five code
Normed division algebra
NP-easy
Bilinear map
Arithmetic-geometric mean
Monoid ring
Mary (programming language)
Gabriel Lamé
Wikipedia:Searching bug reports
Digital Signature Algorithm
Center (group theory)
Equivalence class
Continuity property
Almost everywhere