On-Line Encyclopedia of Integer Sequences


The On-Line Encyclopedia of Integer Sequences, also cited simply as Sloane's, is an online database of integer sequences. It was created and maintained by Neil Sloane while a researcher at AT&T Labs. He transferred the intellectual property and hosting of the OEIS to the OEIS Foundation in 2009. Sloane is president of the OEIS Foundation.
OEIS records information on integer sequences of interest to both professional and amateur mathematicians, and is widely cited. it contains over 334,000 sequences, making it the largest database of its kind.
Each entry contains the leading terms of the sequence, keywords, mathematical motivations, literature links, and more, including the option to generate a graph or play a musical representation of the sequence. The database is searchable by keyword and by subsequence.

History

started collecting integer sequences as a graduate student in 1965 to support his work in combinatorics. The database was at first stored on punched cards. He published selections from the database in book form twice:
  1. A Handbook of Integer Sequences, containing 2,372 sequences in lexicographic order and assigned numbers from 1 to 2372.
  2. The Encyclopedia of Integer Sequences with Simon Plouffe, containing 5,488 sequences and assigned M-numbers from M0000 to M5487. The Encyclopedia includes the references to the corresponding sequences in A Handbook of Integer Sequences as N-numbers from N0001 to N2372 The Encyclopedia includes the A-numbers that are used in the OEIS, whereas the Handbook did not.
These books were well received and, especially after the second publication, mathematicians supplied Sloane with a steady flow of new sequences. The collection became unmanageable in book form, and when the database had reached 16,000 entries Sloane decided to go online—first as an e-mail service, and soon after as a web site. As a spin-off from the database work, Sloane founded the Journal of Integer Sequences in 1998.
The database continues to grow at a rate of some 10,000 entries a year.
Sloane has personally managed 'his' sequences for almost 40 years, but starting in 2002, a board of associate editors and volunteers has helped maintain the database.
In 2004, Sloane celebrated the addition of the 100,000th sequence to the database,, which counts the marks on the Ishango bone. In 2006, the user interface was overhauled and more advanced search capabilities were added. In 2010 an at was created to simplify the collaboration of the OEIS editors and contributors. The 200,000th sequence,, was added to the database in November 2011; it was initially entered as A200715, and moved to A200000 after a week of discussion on the SeqFan mailing list, following a proposal by OEIS Editor-in-Chief Charles Greathouse to choose a special sequence for A200000.

Non-integers

Besides integer sequences, the OEIS also catalogs sequences of fractions, the digits of transcendental numbers, complex numbers and so on by transforming them into integer sequences.
Sequences of rationals are represented by two sequences : the sequence of numerators and the sequence of denominators. For example, the fifth-order Farey sequence,, is catalogued as the numerator sequence 1, 1, 1, 2, 1, 3, 2, 3, 4 and the denominator sequence 5, 4, 3, 5, 2, 5, 3, 4, 5.
Important irrational numbers such as π = 3.1415926535897... are catalogued under representative integer sequences such as decimal expansions ), binary expansions ), or continued fraction expansions ).

Conventions

The OEIS was limited to plain ASCII text until 2011, and it still uses a linear form of conventional mathematical notation. Greek letters are usually represented by their full names, e.g., mu for μ, phi for φ.
Every sequence is identified by the letter A followed by six digits, almost always referred to with leading zeros, e.g., A000315 rather than A315.
Individual terms of sequences are separated by commas. Digit groups are not separated by commas, periods, or spaces.
In comments, formulas, etc., a represents the nth term of the sequence.

Special meaning of zero

Zero is often used to represent non-existent sequence elements. For example, enumerates the "smallest prime of n² consecutive primes to form an n×n magic square of least magic constant, or 0 if no such magic square exists." The value of a is 2; a is 1480028129. But there is no such 2×2 magic square, so a is 0.
This special usage has a solid mathematical basis in certain counting functions. For example, the totient valence function Nφ counts the solutions of φ = m. There are 4 solutions for 4, but no solutions for 14, hence a of A014197 is 0—there are no solutions.
Occasionally −1 is used for this purpose instead, as in.

Lexicographical ordering

The OEIS maintains the lexicographical order of the sequences, so each sequence has a predecessor and a successor. OEIS normalizes the sequences for lexicographical ordering, ignoring all initial zeros and ones, and also the sign of each element. Sequences of weight distribution codes often omit periodically recurring zeros.
For example, consider: the prime numbers, the palindromic primes, the Fibonacci sequence, the lazy caterer's sequence, and the coefficients in the series expansion of. In OEIS lexicographic order, they are:
whereas unnormalized lexicographic ordering would order these sequences thus: #3, #5, #4, #1, #2.

Self-referential sequences

Very early in the history of the OEIS, sequences defined in terms of the numbering of sequences in the OEIS itself were proposed. "I resisted adding these sequences for a long time, partly out of a desire to maintain the dignity of the database, and partly because A22 was only known to 11 terms!", Sloane reminisced.
One of the earliest self-referential sequences Sloane accepted into the OEIS was "a = n-th term of sequence An or -1 if An has fewer than n terms". This sequence spurred progress on finding more terms of.
lists the first term given in sequence An, but it needs to be updated from time to time because of changing opinions on offsets. Listing instead term a of sequence An might seem a good alternative if it weren't for the fact that some sequences have offsets of 2 and greater.
This line of thought leads to the question "Does sequence An contain the number n ?" and the sequences, "Numbers n such that OEIS sequence An contains n", and, "n is in this sequence if and only if n is not in sequence An". Thus, the composite number 2808 is in A053873 because is the sequence of composite numbers, while the non-prime 40 is in A053169 because it's not in, the prime numbers. Each n is a member of exactly one of these two sequences, and in principle it can be determined which sequence each n belongs to, with two exceptions :
This entry,, was chosen because it contains every field an OEIS entry can have.

A046970 Dirichlet inverse of the Jordan function J_2.
1, -3, -8, -3, -24, 24, -48, -3, -8, 72, -120, 24, -168, 144, 192, -3, -288, 24, -360, 72, 384, 360, -528, 24, -24, 504, -8, 144, -840, -576, -960, -3, 960, 864, 1152, 24, -1368, 1080, 1344, 72, -1680, -1152, -1848, 360, 192, 1584, -2208, 24, -48, 72, 2304, 504, -2808, 24, 2880, 144, 2880, 2520, -3480, -576
OFFSET 1,2
COMMENTS B = -B**/)*z/z = -B**/)*Sum
...
REFERENCES M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, Dover Publications, 1965, pp. 805-811.
LINKS M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 .
Wikipedia, Riemann zeta function.
FORMULA Multiplicative with a = 1-p^2. a = Sum_ mu*d^2.
a = product
EXAMPLE a = -8 because the divisors of 3 are and mu*1^2 + mu*3^2 = -8.
...
MAPLE Jinvk := proc local a, f, p ; a := 1 ; for f in ifactors do p := op ; a := a* ; end do: a ; end proc:
A046970 := proc Jinvk ; end proc: # R. J. Mathar, Jul 04 2011
MATHEMATICA muDD := MoebiusMu*d^2; Table
Flatten
PROG A046970=sumdiv
CROSSREFS Cf. A027641 and A027642.
Sequence in context: A035292 A144457 A146975 * A058936 A002017 A118582
Adjacent sequences: A046967 A046968 A046969 * A046971 A046972 A046973
KEYWORD sign,mult
AUTHOR Douglas Stoll, dougstollemail.msn.com
EXTENSIONS Corrected and extended by Vladeta Jovovic, Jul 25 2001
Additional comments from Wilfredo Lopez, Jul 01 2005

Entry fields

; ID number
Numbers n such that the binomial coefficient C is not divisible by the square of an odd prime.
Fibonacci!.
Number of 3-dimensional polyominoes with n cells and symmetry group of order exactly 24.
Smallest number such that n·a is a concatenation of n consecutive integers...
Continued fraction for ζ
Number of permutations satisfying −k ≤ p − i ≤ r and p − i
Length of longest contiguous block of 1s in binary expansion of nth prime.
Exponential convolution of A069321 with itself, where we set A069321 = 0.
Marks from the 22000-year-old Ishango bone from the Congo.
Column 1 of triangle A102230, and equals the convolution of A032349 with A032349 shift right.
Number of consecutive integers starting with n needed to sum to a Niven number.
Triangle-free positive integers.
Möbius transform of sum of prime factors of n with multiplicity.

; Sequence data
; Name
; Comments
; References
; Links
; Formula
; Example
; Maple
; Mathematica
; Program
; See also
3, 8, 3, 9, 4, 5, 2, 3, 1, 2,...Decimal expansion of ln.
1, 1, 1, 3, 8, 3, 10, 1, 110, 3, 406, 3First numerator and then denominator of the central
elements of the 1/3-Pascal triangle.
1, 3, 8, 3, 12, 24, 16, 3, 41, 36, 24,...Number of similar sublattices of Z4 of index n2.
1, −3, −8, −3, −24, 24, −48, −3, −8, 72,...Generated from Riemann zeta function...
0, 1, 3, 8, 3, 30, 20, 144, 90, 40, 840,
504, 420, 5760, 3360, 2688, 1260		Decomposition of Stirling's S based on
associated numeric partitions.
1, 1, 1, 0, −3, −8, −3, 56, 217, 64, −2951, −12672,...Expansion of exp.
3, 8, 4, 1, 4, 9, 9, 0, 0, 7, 5, 4, 3, 5, 0, 7, 8Decimal expansion of upper bound for the r-values
supporting stable period-3 orbits in the logistic equation.

; Keyword
; Offset
; Author
; Extension

Applications

Sloane's gap

In 2009, the OEIS database was used by Philippe Guglielmetti to measure the "importance" of each integer number. The result shown in the plot on the right shows a clear "gap" between two distinct point clouds the "uninteresting numbers" and the "interesting" numbers that occur comparatively more often in sequences from the OEIS. It contains essentially prime numbers, numbers of the form an and highly composite numbers. This phenomenon was studied by Nicolas Gauvrit, Jean-Paul Delahaye and Hector Zenil who explained the speed of the two clouds in terms of algorithmic complexity and the gap by social factors based on an artificial preference for sequences of primes, even numbers, geometric and Fibonacci-type sequences and so on. Sloane's gap was featured on a Numberphile video in 2013.