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 2713 articles , 7 standard articles )
Showing results 1 to 20 of 2713.
Sorted by year (- Anderson, Nicole; Breunig, Michael; Goryl, Kyle; Lewis, Hannah; Riehl, Manda; Scanlan, McKenzie: Properties of RNA secondary structure matching models (2019)
- Baril, Jean-Luc; Kirgizov, Sergey; Petrossian, Armen: Enumeration of \Lukasiewiczpaths modulo some patterns (2019)
- Barry, Paul: The $\gamma$-vectors of Pascal-like triangles defined by Riordan arrays (2019)
- Barry, Paul: The central coefficients of a family of Pascal-like triangles and colored lattice paths (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)
- 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)
- Engbers, John; Galvin, David; Smyth, Cliff: Restricted Stirling and Lah number matrices and their inverses (2019)
- Farhi, Bakir: Summation of certain infinite Lucas-related series (2019)
- Gledel, Valentin; Parreau, Aline: Identification of points using disks (2019)
- Krasko, Evgeniy; Omelchenko, Alexander: Enumeration of $r$-regular maps on the torus. I: Rooted maps on the torus, the projective plane and the Klein bottle. Sensed maps on the torus (2019)
- Kumar, Ajay; Kumar, Chanchal: Monomial ideals induced by permutations avoiding patterns (2019)
- Lu, Dawei; Wang, Xiaoguang; Xu, Ruiqing: Some new exponential-function estimates of the Somos’ quadratic recurrence constant (2019)
- Malajovich, Gregorio: Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric (2019)
- Manes, K.; Tasoulas, I.; Sapounakis, A.; Tsikouras, P.: Counting pairs of noncrossing binary paths: a bijective approach (2019)
- Mansour, Toufik; Skogman, Howard; Smith, Rebecca: Passing through a stack $k$ times (2019)
- Morales, Alejandro H.; Pak, Igor; Panova, Greta: Asymptotics of principal evaluations of Schubert polynomials for layered permutations (2019)
- Mühle, Henri: The core label order of a congruence-uniform lattice (2019)