OEIS
The On-Line Encyclopedia of Integer Sequence. The main use for the OEIS is to identify a number sequence that you have come across, perhaps in your work, while reading a book, or in a quiz, etc. For example, you discover what you think may be a new algorithm for checking that a file of medical records is in the correct order. (Perhaps you are a computer scientist or someone working in information science.) To handle files of 1, 2, 3, 4, ... records, your algorithm takes 0, 1, 3, 5, 9, 11, 14, 17, 25, ... steps. How can you check if someone has discovered this algorithm before? You decide to ask the OEIS if this sequence has appeared before in the scientific literature. You go the OEIS web site, enter the numbers you have calculated, and click ”Submit”. The reply tells you that this is sequence A3071, which is the number of steps needed for ”sorting by list merging”, a well-known algorithm. The entry directs you to Section 5.3.1 of Volume 3 of D. E. Knuth, ”The Art of Computer Programming”, where you find your algorithm described. The entry even gives an explicit formula for the nth term. You decide not to apply for a patent! The OEIS web site includes a list of well over 3000 books and articles that have acknowledged help from the OEIS.
Keywords for this software
References in zbMATH (referenced in 2449 articles , 7 standard articles )
Showing results 1 to 20 of 2449.
Sorted by year (- Absil, Romain; Camby, Eglantine; Hertz, Alain; Mélot, Hadrien: A sharp lower bound on the number of non-equivalent colorings of graphs of order $n$ and maximum degree $n - 3$ (2018)
- Barrientos, Christian; Minion, Sarah: On the number of $\alpha$-labeled graphs (2018)
- Bevan, David; Homberger, Cheyne; Tenner, Bridget Eileen: Prolific permutations and permuted packings: downsets containing many large patterns (2018)
- Castro, Francis N.; González, Oscar E.; Medina, Luis A.: Generalized exponential sums and the power of computers (2018)
- Feltrin, Guglielmo: Positive subharmonic solutions to superlinear ODEs with indefinite weight (2018)
- Francetić, Nevena; Herke, Sarada; Wanless, Ian M.: Parity of sets of mutually orthogonal Latin squares (2018)
- Goupil, Alain; Pellerin, Marie-Eve; de Wouters d’oplinter, Jér^ome: Partially directed snake polyominoes (2018)
- Jeannerod, Claude-Pierre; Rump, Siegfried M.: On relative errors of floating-point operations: optimal bounds and applications (2018)
- Kumar, Ajay; Kumar, Chanchal: An integer sequence and standard monomials (2018)
- Kuszmaul, William: Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations (2018)
- Moghaddamfar, A.R.; Salehy, S.Navid; Salehy, S.Nima: A matrix-theoretic perspective on some identities involving well-known sequences (2018)
- Mu, Yan-Ping; Sun, Zhi-Wei: Telescoping method and congruences for double sums (2018)
- Rubinchik, Mikhail; Shur, Arseny M.: EERTREE: an efficient data structure for processing palindromes in strings (2018)
- Wilson, A.T.: Torus link homology and the nabla operator (2018)
- Zhuang, Yan: A generalized Goulden-Jackson cluster method and lattice path enumeration (2018)
- Adamyk, K.L.M.; Holmes, E.; Mayfield, G.R.; Moritz, D.J.; Scheepers, M.; Tenner, B.E.; Wauck, H.C.: Sorting permutations: games, genomes, and cycles (2017)
- Alexeev, Nikita; Tikhomirov, Alexander: Singular values distribution of squares of elliptic random matrices and type B Narayana polynomials (2017)
- Alkan, Altug; Fox, Nathan; Aybar, O.Ozgur: On Hofstadter heart sequences (2017)
- Alkauskas, Giedrius: The modular group and words in its two generators (2017)
- Alm, Jeremy F.: 401 and beyond: improved bounds and algorithms for the Ramsey algebra search (2017)