Integer sequence

Integer sequence

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:

Computable and definable sequences

An integer sequence is a computable sequence, if there exists an algorithm which given n, calculates an, for all n > 0. An integer sequence is a definable sequence, if there exists some statement P(x) which is true for that integer sequence x and false for all other integer sequences. The set of computable integer sequences and definable integer sequences are both countable, with the computable sequences a proper subset of the definable sequences (in other words, some sequences are definable but not computable). The set of all integer sequences is uncountable (with cardinality equal to that of the continuum); thus, almost all integer sequences are uncomputable and cannot be defined.

Complete sequences

An integer sequence is called a complete sequence if every positive integer can be expressed as a sum of values in the sequence, using each value at most once.

See also

External links


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Integer sequence prime — In mathematics, an integer sequence prime is a prime number found as a member of an integer sequence. For example, the 8th Delannoy number, 265729, is prime. A challenge in empirical mathematics is to identify large prime values in rapidly… …   Wikipedia

  • Sequence — For other uses, see Sequence (disambiguation). In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements or terms), and the number of terms (possibly infinite) is called the length …   Wikipedia

  • Integer — This article is about the mathematical concept. For integers in computer science, see Integer (computer science). Symbol often used to denote the set of integers The integers (from the Latin integer, literally untouched , hence whole : the word… …   Wikipedia

  • Sequence transformation — In mathematics, a sequence transformation is an operator acting on a given space of sequences. Sequence transformations include linear mappings such as convolution with another sequence, and resummation of a sequence and, more generally, are… …   Wikipedia

  • Integer (computer science) — In computer science, an integer is a datum of integral data type, a data type which represents some finite subset of the mathematical integers. Integral data types may be of different sizes and may or may not be allowed to contain negative values …   Wikipedia

  • Integer square root — In number theory, the integer square root (isqrt) of a positive integer n is the positive integer m which is the greatest integer less than or equal to the square root of n ,: mbox{isqrt}( n ) = lfloor sqrt n floor.For example, mbox{isqrt}(27) =… …   Wikipedia

  • Sequence motif — In genetics, a sequence motif is a nucleotide or amino acid sequence pattern that is widespread and has, or is conjectured to have, a biological significance. For proteins, a sequence motif is distinguished from a structural motif, a motif formed …   Wikipedia

  • Divisibility sequence — In mathematics, a divisibility sequence is an integer sequence such that for all natural numbers m, n, i.e., whenever one index is a multiple of another one, then the corresponding term also is a multiple of the other term. The concept… …   Wikipedia

  • Complete sequence — In mathematics, an integer sequence is called a complete sequence if every positive integer can be expressed as a sum of values in the sequence, using each value at most once. For example, the sequence of powers of two {1, 2, 4, 8, ...}, based on …   Wikipedia

  • Ergodic sequence — In mathematics, an ergodic sequence is a certain type of integer sequence, having certain equidistribution properties.DefinitionLet A = {a j} be an infinite, strictly increasing sequence of positive integers. Then, given an integer q , this… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”