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

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

1 2 3 ... 101 102 103 next

  1. Abatzoglou, Alexander; Silverberg, Alice; Sutherland, Andrew V.; Wong, Angela: A framework for deterministic primality proving using elliptic curves with complex multiplication (2016)
  2. Acan, Hüseyin; Hitczenko, Paweł: On random trees obtained from permutation graphs (2016)
  3. Adler, V.E.: Set partitions and integrable hierarchies (2016)
  4. Alekseyev, Max A.: Computing the inverses, their power sums, and extrema for Euler’s totient and other multiplicative functions (2016)
  5. Almodovar, Leyda; Moll, Victor H.; Quan, Hadrian; Roman, Fernando; Rowland, Eric; Washington, Michole: Infinite products arising in paperfolding (2016)
  6. Altınışık, Ercan; Keskin, Ali; Yıldız, Mehmet; Demirbüken, Murat: On a conjecture of Ilmonen, Haukkanen and Merikoski concerning the smallest eigenvalues of certain GCD related matrices (2016)
  7. Anantakitpaisal, Pornpawee; Kuhapatanakul, Kantaphon: Reciprocal sums of the tribonacci numbers (2016)
  8. Andrews, George E.; Sellers, James A.: Congruences for the Fishburn numbers (2016)
  9. Ashrafi, Ali Reza; Azarija, Jernej; Fathalikhani, Khadijeh; Klavžar, Sandi; Petkovšek, Marko: Vertex and edge orbits of Fibonacci and Lucas cubes (2016)
  10. Bach, Quang T.; Remmel, Jeffrey B.: Generating functions for descents over permutations which avoid sets of consecutive patterns (2016)
  11. Badziahin, Dzmitry; Shallit, Jeffrey: An unusual continued fraction (2016)
  12. Ballantine, Cristina; Merca, Mircea: Padovan numbers as sums over partitions into odd parts (2016)
  13. Barabash, G.M.; Kholyavka, Ya.M.; Tytar, I.V.: Periodic words connected with the Fibonacci words (2016)
  14. Baril, Jean-Luc: Avoiding patterns in irreducible permutations (2016)
  15. Baril, Jean-Luc; Genestier, Richard; Giorgetti, Alain; Petrossian, Armen: Rooted planar maps modulo some patterns (2016)
  16. Barry, Paul: Jacobsthal decompositions of pascals triangle, ternary trees, and alternating sign matrices (2016)
  17. Barry, Paul: Riordan arrays, generalized Narayana triangles, and series reversion (2016)
  18. Bedratyuk, Leonid; Bedratyuk, Anna: A new formula for the generating function of the numbers of simple graphs (2016)
  19. Berliner, Adam H.; Dean, Nathaniel; Hook, Jonelle; Marr, Alison; Mbirika, Aba; McBee, Cayla D.: Coprime and prime labelings of graphs (2016)
  20. Birmajer, Daniel; Gil, Juan B.; Weiner, Michael D.: On the enumeration of restricted words over a finite alphabet (2016)

1 2 3 ... 101 102 103 next