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

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

1 2 3 ... 159 160 161 next

  1. Agoh, Takashi: On generalized Euler numbers and polynomials related to values of the Lerch zeta function (2020)
  2. Agrawal, Aman; Choi, Caroline; Sun, Nathan: On permutation weights and (q)-Eulerian polynomials (2020)
  3. Ahmia, Moussa; Belbachir, Hacène: Log-concavity and LC-positivity for generalized triangles (2020)
  4. Alkan, Altug; Aybar, Orhan Ozgur: On families of solutions for meta-Fibonacci recursions related to Hofstadter-Conway $10000 sequence (2020)
  5. Allouche, Jean-Paul; Shallit, Jeffrey; Wen, Zhi-Xiong; Wu, Wen; Zhang, Jie-Meng: Sum-free sets generated by the period-(k)-folding sequences and some Sturmian sequences (2020)
  6. Alper, Jarod; Rowlands, Rowan: Syzygies of the apolar ideals of the determinant and permanent (2020)
  7. Anđelić, Milica; Du, Zhibin; da Fonseca, Carlos M.; Kılıç, Emrah: A matrix approach to some second-order difference equations with sign-alternating coefficients (2020)
  8. Andrews, George E.; Beck, George; Hopkins, Brian: On a conjecture of Hanna connecting distinct part and complete partitions (2020)
  9. Andrews, George E.; Merca, Mircea: On the number of even parts in all partitions of (n) into distinct parts (2020)
  10. Andrews, George E.; Newman, David: The minimal excludant in integer partitions (2020)
  11. Archer, Kassie; Bishop, Abigail C.; Diaz-Lopez, Alexander; García Puente, Luis D.; Glass, Darren; Louwsma, Joel: Arithmetical structures on bidents (2020)
  12. Archibald, M.; Blecher, A.; Knopfmacher, A.; Mays, M. E.: Inversions and parity in compositions of integers (2020)
  13. Artacho, Francisco J. Aragón; Campoy, Rubén; Elser, Veit: An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (2020)
  14. Asinowski, Andrei; Bacher, Axel; Banderier, Cyril; Gittenberger, Bernhard: Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata (2020)
  15. Au, Yu Hin (Gary); Bagherzadeh, Fatemeh; Bremner, Murray R.: Enumeration and asymptotic formulas for rectangular partitions of the hypercube (2020)
  16. Ayyer, Arvind; Josuat-Vergès, Matthieu; Ramassamy, Sanjay: Extensions of partial cyclic orders and consecutive coordinate polytopes (2020)
  17. Bača, M.; López, S. C.; Muntaner-Batle, F. A.; Semaničová-Feňovčíková, A.: New constructions for the (n)-queens problem (2020)
  18. Bagno, Eli; Eisenberg, Estrella; Reches, Shulamit; Sigron, Moriah: On the poset of non-attacking King permutations (2020)
  19. Balko, Martin; Pór, Attila; Scheucher, Manfred; Swanepoel, Konrad; Valtr, Pavel: Almost-equidistant sets (2020)
  20. Ballantine, Cristina; Merca, Mircea: Bisected theta series, least (r)-gaps in partitions, and polygonal numbers (2020)

1 2 3 ... 159 160 161 next