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.

References in zbMATH (referenced in 3479 articles , 8 standard articles )

Showing results 1 to 20 of 3479.
Sorted by year (citations)

1 2 3 ... 172 173 174 next

  1. Ahmia, Moussa; Rezig, Boualam: Two-Motzkin-like numbers and Stieltjes moment sequences (2021)
  2. Alkan, Altug; Booker, Andrew R.; Luca, Florian: On a recursively defined sequence involving the prime counting function (2021)
  3. Andrica, Dorin; Bagdasar, Ovidiu: On some new arithmetic properties of the generalized Lucas sequences (2021)
  4. Au, Yu Hin (Gary): Some properties and combinatorial implications of weighted small Schröder numbers (2021)
  5. Baren, Theresa; Cory, Michael; Friedberg, Mia; Gardner, Peter; Hammer, James; Harrington, Joshua; McGinnis, Daniel; Waechter, Riley; Wong, Tony W. H.: On the domination number of permutation graphs and an application to strong fixed points (2021)
  6. Bernig, Andreas: Unitarily invariant valuations and Tutte’s sequence (2021)
  7. Birmajer, Daniel; Gil, Juan D.; Gil, Juan B.; Weiner, Michael D.: Schröder coloring and applications (2021)
  8. Bonatto, Marco; Kinyon, Michael; Stanovský, David; Vojtěchovský, Petr: Involutive Latin solutions of the Yang-Baxter equation (2021)
  9. Brenti, Francesco; Carnevale, Angela: Odd length: odd diagrams and descent classes (2021)
  10. Brysiewicz, Taylor: Necklaces count polynomial parametric osculants (2021)
  11. Chu, Hùng Việt: Divisibility of divisor functions of even perfect numbers (2021)
  12. Cicalese, Ferdinando; Lipták, Zsuzsanna; Rossi, Massimiliano: On infinite prefix normal words (2021)
  13. Colaric, Emma; DeMuse, Ryan; Martin, Jeremy L.; Yin, Mei: Interval parking functions (2021)
  14. Coons, Jane Ivy; Sullivant, Seth: Toric geometry of the Cavender-Farris-Neyman model with a molecular clock (2021)
  15. Dalfó, C.; Fiol, M. A.; López, N.: New results for the Mondrian art problem (2021)
  16. Dekking, F. Michel: The sum of digits functions of the Zeckendorf and the base phi expansions (2021)
  17. Dershowitz, Nachum: Between Broadway and the Hudson: a bijection of corridor paths (2021)
  18. Dixit, Atul; Eyyunni, Pramod; Maji, Bibekananda; Sood, Garima: Untrodden pathways in the theory of the restricted partition function (p(n,N)) (2021)
  19. Ejsmont, Wiktor; Lehner, Franz: The trace method for cotangent sums (2021)
  20. Elizalde, Sergi: Descents on quasi-Stirling permutations (2021)

1 2 3 ... 172 173 174 next