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 2738 articles , 7 standard articles )
Showing results 1 to 20 of 2738.
Sorted by year (- Akgün, Özgür; Gent, Ian; Kitaev, Sergey; Zantema, Hans: Solving computational problems in the theory of word-representable graphs (2019)
- Anderson, Nicole; Breunig, Michael; Goryl, Kyle; Lewis, Hannah; Riehl, Manda; Scanlan, McKenzie: Properties of RNA secondary structure matching models (2019)
- Aronov, Boris; Dujmović, Vida; Morin, Pat; Ooms, Aurélien; Schultz Xavier da Silveira, Luís Fernando: More Turán-type theorems for triangles in convex point sets (2019)
- Baril, Jean-Luc; Kirgizov, Sergey; Petrossian, Armen: Enumeration of Łukasiewicz paths modulo some patterns (2019)
- Barry, Paul: The central coefficients of a family of Pascal-like triangles and colored lattice paths (2019)
- Barry, Paul: The (\gamma)-vectors of Pascal-like triangles defined by Riordan arrays (2019)
- Bean, Christian; Gudmundsson, Bjarki; Ulfarsson, Henning: Automatic discovery of structural rules of permutation classes (2019)
- Benoumhani, Moussa; Jaballah, Ali: Chains in lattices of mappings and finite fuzzy topological spaces (2019)
- Birmajer, Daniel; Gil, Juan B.; Weiner, Michael D.: A family of Bell transformations (2019)
- Butler, Steve; Choi, Jeongyoon; Kim, Kimyung; Seo, Kyuhyeok: Enumerating multiplex juggling patterns (2019)
- Cai, Yue; Yan, Catherine: Counting with Borel’s triangle (2019)
- Ceria, Michela: Bar code for monomial ideals (2019)
- Chatel, Grégory; Pilaud, Vincent; Pons, Viviane: The weak order on integer posets (2019)
- Chen, Dandan; Yan, Sherry H. F.; Zhou, Robin D. P.: Equidistributed statistics on Fishburn matrices and permutations (2019)
- Ciobanu, Laura; Kolpakov, Alexander: Free subgroups of free products and combinatorial hypermaps (2019)
- Dolinka, Igor; East, James; Evangelou, Athanasios; FitzGerald, Des; Ham, Nicholas; Hyde, James; Loughlin, Nicholas; Mitchell, James D.: Enumeration of idempotents in planar diagram monoids (2019)
- Dugan, William; Glennon, Sam; Gunnells, Paul E.; Steingrímsson, Einar: Tiered trees, weights, and (q)-Eulerian numbers (2019)
- Du, Rosena R. X.; Fan, Xiaojie; Zhao, Yue: Enumeration on row-increasing tableaux of shape (2 \timesn) (2019)
- Du, Rosena R. X.; He, Jia; Yun, Xueli: Counting vertices with given outdegree in plane trees and (k)-ary trees (2019)
- Engbers, John; Galvin, David; Smyth, Cliff: Restricted Stirling and Lah number matrices and their inverses (2019)