OEIS

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

Showing results 2741 to 2760 of 3168.
Sorted by year (citations)

previous 1 2 3 ... 136 137 138 139 140 ... 157 158 159 next

  1. Aguiar, Marcelo; Nyman, Kathryn; Orellana, Rosa: New results on the peak algebra. (2006)
  2. Akbary, Amir; Wang, Qiang: A generalized Lucas sequence and permutation binomials (2006)
  3. Albert, M. H.; Elder, M.; Rechnitzer, A.; Westcott, P.; Zabrocki, M.: On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia (2006)
  4. Alzer, Horst: Sharp inequalities for the harmonic numbers (2006)
  5. Alzer, Horst; Karayannakis, Dimitri; Srivastava, H. M.: Series representations for some mathematical constants (2006)
  6. Asveld, Peter R. J.: Generating all permutations by context-free grammars in Chomsky normal form (2006)
  7. Barcucci, E.; Bernini, A.; Poneti, M.: From Fibonacci to Catalan permutations (2006)
  8. Baril, J. L.; Pallo, J. M.: The phagocyte lattice of Dyck words (2006)
  9. Barry, Paul: On integer-sequence-based constructions of generalized Pascal triangles (2006)
  10. Bassetti, Federico; Diaconis, Persi: Examples comparing importance sampling and the Metropolis algorithm (2006)
  11. Benoumhani, Moussa: The number of topologies on a finite set (2006)
  12. Bergeron, N.; Hohlweg, C.; Zabrocki, M.: Posets related to the connectivity set of Coxeter groups. (2006)
  13. Bodirsky, Manuel; Kang, Mihyun: Generating outerplanar graphs uniformly at random (2006)
  14. Burstein, Alexander; Elizalde, Sergi; Mansour, Toufik: Restricted Dumont permutations, Dyck paths, and noncrossing partitions (2006)
  15. Callan, David: A combinatorial interpretation of the eigensequence for composition (2006)
  16. Čerin, Zvonko; Gianella, Gian Mario: On sums of squares of Pell-Lucas numbers (2006)
  17. Chabert, Jean-Luc; Cahen, Paul-Jean: Old problems and new questions around integer-valued polynomials and factorial sequences (2006)
  18. Chaumont, Alain; Müller, Tom: All elite primes up to 250 billion (2006)
  19. Chen, Hongwei: Evaluations of some variant Euler sums (2006)
  20. Colton, Simon; Muggleton, Stephen: Mathematical applications of inductive logic programming (2006)

previous 1 2 3 ... 136 137 138 139 140 ... 157 158 159 next