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

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

1 2 3 ... 108 109 110 next

  1. Alkauskas, Giedrius: The modular group and words in its two generators (2017)
  2. Amoud, Ammar; Bultel, Jean-Paul; Chouria, Ali; Luque, Jean-Gabriel; Mallet, Olivier: Word Bell polynomials (2017)
  3. Apagodu, Moa; Applegate, David; Sloane, N.J.A.; Zeilberger, Doron: Analysis of the gift exchange problem (2017)
  4. Balchin, Scott; Rust, Dan: Computations for symbolic substitutions (2017)
  5. Ballantine, Cristina; Merca, Mircea: New convolutions for the number of divisors (2017)
  6. Ballot, Christian: On functions expressible as words on a pair of Beatty sequences (2017)
  7. Bates, Larry; Gibson, Peter: A geometry where everything is better than nice (2017)
  8. Bean, Christian; Ulfarsson, Henning; Claesson, Anders: Enumerations of permutations simultaneously avoiding a vincular and a covincular pattern of length 3 (2017)
  9. Benyahia-Tani, Nesrine; Bouroubi, Sadek; Kihel, Omar: An effective approach for integer partitions using exactly two distinct sizes of parts (2017)
  10. Billey, Sara C.; Konvalinka, Matjaž; Matsen, Frederick A. IV: On the enumeration of tanglegrams and tangled chains (2017)
  11. 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)
  12. Cárcamo, Javier: Maps preserving moment sequences (2017)
  13. Chen, Chao-Ping: Sharp inequalities and asymptotic series related to Somos’ quadratic recurrence constant (2017)
  14. Cheng, Ting-Yuan; Eu, Sen-Peng; Fu, Tung-Shan; Lee, Yi-Lin: Skew standard domino tableaux and partial Motzkin paths (2017)
  15. Chen, Ricky X.F.; Reidys, Christian M.: A combinatorial identity concerning plane colored trees and its applications (2017)
  16. Cosgrave, John B.; Dilcher, Karl: A role for generalized Fermat numbers (2017)
  17. De Baerdemacker, Stijn; De Vos, Alexis; Chen, Lin; Yu, Li: The Birkhoff theorem for unitary matrices of arbitrary dimensions (2017)
  18. Dershowitz, Nachum: Touchard’s Drunkard (2017)
  19. Drube, Paul: Generating functions for inverted semistandard Young tableaux and generalized ballot numbers (2017)
  20. 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)

1 2 3 ... 108 109 110 next