World Library  
Flag as Inappropriate
Email this Article

Integer sequence

Article Id: WHEBN0000051421
Reproduction Date:

Title: Integer sequence  
Author: World Heritage Encyclopedia
Language: English
Subject: List of OEIS sequences, Complete sequence, Fibonacci number, Series (mathematics), Sequence
Collection: Arithmetic Functions, Integer Sequences
Publisher: World Heritage Encyclopedia

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.


  • Examples 1
  • Computable and definable sequences 2
  • Complete sequences 3
  • See also 4
  • External links 5


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

  • Journal of Integer Sequences. Articles are freely available online.
  • Inductive Inference of Integer Sequences
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from World eBook Library are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.