Integer sequence
Encyclopedia : I : IN : INT : 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.
Integer sequences which have received their own name include:
- Abundant numbers
- Bell numbers
- Binomial coefficients
- Carmichael numbers
- Catalan numbers
- Composite numbers
- Deficient numbers
- Euler numbers
- Even and odd numbers
- Factorial numbers
- Fibonacci numbers
- Figurate numbers
- Happy numbers
- Highly totient numbers
- Highly composite numbers
- Hyperperfect numbers
- Lucky numbers
- Lucas numbers
- Perfect numbers
- Pseudoperfect numbers
- Prime numbers
- Pseudoprime numbers
- Semiperfect numbers
- Semiprime numbers
- Weird numbers
See also
External links
- [Journal of Integer Sequences]. Articles are freely available online.
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.
