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 2621 articles , 7 standard articles )
Showing results 1 to 20 of 2621.
Sorted by year (- Ablinger, J.; Blümlein, J.; De Freitas, A.; van Hoeij, M.; Imamoglu, E.; Raab, C. G.; Radu, C.-S.; Schneider, C.: Iterated elliptic and hypergeometric integrals for Feynman diagrams (2018)
- 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)
- a Campo, Frank: Relations between powers of Dedekind numbers and exponential sums related to them (2018)
- Adin, Ron M.; Bagno, Eli; Roichman, Yuval: Block decomposition of permutations and Schur-positivity (2018)
- Aliev, I.; De Loera, J. A.; Eisenbrand, Friedrich; Oertel, T.; Weismantel, Robert: The support of integer optimal solutions (2018)
- Asinowski, Andrei; Bacher, Axel; Banderier, Cyril; Gittenberger, Bernhard: Analytic combinatorics of lattice paths with forbidden patterns: enumerative aspects (2018)
- Avendaño, Martín; Kogan, Roman; Nisse, Mounir; Rojas, J. Maurice: Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces (2018)
- Baake, Michael; Coons, Michael: A natural probability measure derived from Stern’s diatomic sequence (2018)
- Bach, Eric; Dusart, Jérémie; Hellerstein, Lisa; Kletenik, Devorah: Submodular goal value of Boolean functions (2018)
- Ballot, Christian: Lucasnomial Fuss-Catalan numbers and related divisibility questions (2018)
- Barghi, Amir: Stirling numbers of the first kind for graphs (2018)
- Baril, Jean-Luc; Kirgizov, Sergey; Petrossian, Armen: Dyck paths with a first return decomposition constrained by height (2018)
- Baril, Jean-Luc; Kirgizov, Sergey; Vajnovszki, Vincent: Descent distribution on Catalan words avoiding a pattern of length at most three (2018)
- Barnard, Emily; Reading, Nathan: Coxeter-bicatalan combinatorics (2018)
- Barrientos, Christian; Minion, Sarah: On the number of $\alpha$-labeled graphs (2018)
- Barry, Paul: On a transformation of Riordan moment sequences (2018)
- Barry, Paul; Mesinga Mwafise, Arnauld: Classical and semi-classical orthogonal polynomials defined by Riordan arrays, and their moment sequences (2018)
- Behan, Connor: Conformal manifolds: ODEs from OPEs (2018)
- Benkart, Georgia; Elduque, Alberto: Cross products, invariants, and centralizers (2018)
- Benkart, Georgia; Moon, Dongho: Walks on graphs and their connections with tensor invariants and centralizer algebras (2018)