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

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

1 2 3 ... 208 209 210 next

  1. Allouche, J.-P.; Shallit, J.; Yassawi, R.: How to prove that a sequence is not automatic (2022)
  2. Altynbek, Serik; Begehr, Heinrich: A pair of rational double sequences (2022)
  3. Anatriello, Giuseppina; Németh, László; Vincenzi, Giovanni: Generalized Pascal’s triangles and associated (k)-Padovan-like sequences (2022)
  4. Bagno, Eli; Garber, David; Novick, Mordechai: The Worpitzky identity for the groups of signed and even-signed permutations (2022)
  5. Ballantine, Cristina; Merca, Mircea: Alignments of permutations: their number, mean number, and total number of cycles (2022)
  6. Bardakov, Valeriy G.; Gubarev, Vsevolod: Rota-Baxter groups, skew left braces, and the Yang-Baxter equation (2022)
  7. Bazzanella, Danilo; Di Scala, Antonio; Dutto, Simone; Murru, Nadir: Primality tests, linear recurrent sequences and the Pell equation (2022)
  8. Bényi, Beáta: A bijection for the Boolean numbers of Ferrers graphs (2022)
  9. Bényi, Beáta; Ramírez, José L.: On (q)-poly-Bernoulli numbers arising from combinatorial interpretations (2022)
  10. Betz, Alexander; Nash, David A.: Classifying groups with a small number of subgroups (2022)
  11. Bianconi, Francesco; Brugnoli, Emanuele: Enumerating necklaces with transitions (2022)
  12. Blecher, Aubrey; Knopfmacher, Arnold; Mansour, Toufik: Alphabetic points in restricted growth functions (2022)
  13. Bordewich, Magnus; Linz, Simone; Owen, Megan; John, Katherine St.; Semple, Charles; Wicke, Kristina: On the maximum agreement subtree conjecture for balanced trees (2022)
  14. Brenner, Ulrich; Silvanus, Anna; Silvanus, Jannik: Constructing depth-optimum circuits for adders and \textscAnd-\textscOrpaths (2022)
  15. Briand, Emmanuel: On partitions with (k) corners not containing the staircase with one more corner (2022)
  16. Bridoux, Florian; Durbec, Amélia; Perrot, Kevin; Richard, Adrien: Complexity of fixed point counting problems in Boolean networks (2022)
  17. Byrnes, Kevin M.: Isomorphism of maximum length circuit codes (2022)
  18. Cai, Zhijun; Ding, Jian; Mei, Zhousheng; Wang, Suijie: Pattern avoidance in biwords (2022)
  19. Castiglioni, J. L.; Celani, S. A.; San Martín, H. J.: On Hilbert algebras generated by the order (2022)
  20. Catarino, P.; Almeida, R.: A note on Vietoris’ number sequence (2022)

1 2 3 ... 208 209 210 next