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 2180 articles , 7 standard articles )
Showing results 1 to 20 of 2180.
Sorted by year (- Balchin, Scott; Rust, Dan: Computations for symbolic substitutions (2017)
- Ballantine, Cristina; Merca, Mircea: New convolutions for the number of divisors (2017)
- Ballot, Christian: On functions expressible as words on a pair of Beatty sequences (2017)
- Bates, Larry; Gibson, Peter: A geometry where everything is better than nice (2017)
- Billey, Sara C.; Konvalinka, Matjaž; Matsen, Frederick A. IV: On the enumeration of tanglegrams and tangled chains (2017)
- Boyland, Peter; Pintér, Gabriella; Laukó, István; Roth, Ivan; Schoenfield, Jon E.; Wasielewski, Stephen: On the maximum number of non-intersecting diagonals in an array (2017)
- Cárcamo, Javier: Maps preserving moment sequences (2017)
- Chen, Chao-Ping: Sharp inequalities and asymptotic series related to Somos’ quadratic recurrence constant (2017)
- Cheng, Ting-Yuan; Eu, Sen-Peng; Fu, Tung-Shan; Lee, Yi-Lin: Skew standard domino tableaux and partial Motzkin paths (2017)
- Chen, Ricky X.F.; Reidys, Christian M.: A combinatorial identity concerning plane colored trees and its applications (2017)
- Cosgrave, John B.; Dilcher, Karl: A role for generalized Fermat numbers (2017)
- De Baerdemacker, Stijn; De Vos, Alexis; Chen, Lin; Yu, Li: The Birkhoff theorem for unitary matrices of arbitrary dimensions (2017)
- Dershowitz, Nachum: Touchard’s Drunkard (2017)
- Eu, Sen-Peng; Fu, Tung-Shan; Liang, Yu-Chang; Wong, Tsai-Lien: On $xD$-generalizations of Stirling numbers and Lah numbers via graphs and rooks (2017)
- Foata, Dominique; Han, Guo-Niu; Strehl, Volker: The Entringer-Poupard matrix sequence (2017)
- Goy, Taras; Zatorsky, Roman: Infinite linear recurrence relations and superposition of linear recurrence equations (2017)
- Gözükırmızı, Coşar; Kırkın, Melike Ebru; Demiralp, Metin: Probabilistic evolution theory for the solution of explicit autonomous ordinary differential equations: squarified telescope matrices (2017)
- Gray, W.Steven; Ebrahimi-Fard, Kurusch: SISO output affine feedback transformation group and its Faà di Bruno Hopf algebra (2017)
- Guo, Victor J.W.; Yang, Yiting: Proof of a conjecture of Kl\oveon permutation codes under the Chebychev distance (2017)
- Hamaker, Zachary; Marberg, Eric; Pawlowski, Brendan: Involution words. II: Braid relations and atomic structures (2017)