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 2259 articles , 7 standard articles )

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

1 2 3 ... 111 112 113 next

  1. Alkauskas, Giedrius: The modular group and words in its two generators (2017)
  2. Amburg, Ilya; Dasaratha, Krishna; Flapan, Laure; Garrity, Thomas; Lee, Chansoo; Mihaila, Cornelia; Neumann-Chun, Nicholas; Peluse, Sarah; Stoffregen, Matthew: Stern sequences for a family of multidimensional continued fractions: TRIP-Stern sequences (2017)
  3. Amoud, Ammar; Bultel, Jean-Paul; Chouria, Ali; Luque, Jean-Gabriel; Mallet, Olivier: Word Bell polynomials (2017)
  4. Apagodu, Moa; Applegate, David; Sloane, N.J.A.; Zeilberger, Doron: Analysis of the gift exchange problem (2017)
  5. Balchin, Scott; Rust, Dan: Computations for symbolic substitutions (2017)
  6. Ballantine, Cristina; Merca, Mircea: New convolutions for the number of divisors (2017)
  7. Ballot, Christian: On functions expressible as words on a pair of Beatty sequences (2017)
  8. Bates, Larry; Gibson, Peter: A geometry where everything is better than nice (2017)
  9. Bayless, Jonathan; Kinlaw, Paul: Explicit bounds for the sum of reciprocals of pseudoprimes and Carmichael numbers (2017)
  10. Bean, Christian; Ulfarsson, Henning; Claesson, Anders: Enumerations of permutations simultaneously avoiding a vincular and a covincular pattern of length 3 (2017)
  11. Benoumhani, Moussa; Jaballah, Ali: Finite fuzzy topological spaces (2017)
  12. Benyahia-Tani, Nesrine; Bouroubi, Sadek; Kihel, Omar: An effective approach for integer partitions using exactly two distinct sizes of parts (2017)
  13. Bilgici, Göksal; Tokeşer, Ümit; Ünal, Zafer: Fibonacci and Lucas sedenions (2017)
  14. Billey, Sara C.; Konvalinka, Matjaž; Matsen, Frederick A. IV: On the enumeration of tanglegrams and tangled chains (2017)
  15. Blagouchine, Iaroslav V.: A note on some recent results for the Bernoulli numbers of the second kind (2017)
  16. Bordellès, Olivier: Long and short sums of a twisted divisor function (2017)
  17. Bowles, Juliana; Caminati, Marco B.: A verified algorithm enumerating event structures (2017)
  18. 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)
  19. Cárcamo, Javier: Maps preserving moment sequences (2017)
  20. Celeste, Richell O.; Corcino, Roberto B.; Gonzales, Ken Joffaniel M.: Two approaches to normal order coefficients (2017)

1 2 3 ... 111 112 113 next