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

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

1 2 3 ... 132 133 134 next

  1. Anderson, Nicole; Breunig, Michael; Goryl, Kyle; Lewis, Hannah; Riehl, Manda; Scanlan, McKenzie: Properties of RNA secondary structure matching models (2019)
  2. Benoumhani, Moussa; Jaballah, Ali: Chains in lattices of mappings and finite fuzzy topological spaces (2019)
  3. Birmajer, Daniel; Gil, Juan B.; Weiner, Michael D.: A family of Bell transformations (2019)
  4. Cai, Yue; Yan, Catherine: Counting with Borel’s triangle (2019)
  5. Ceria, Michela: Bar code for monomial ideals (2019)
  6. Engbers, John; Galvin, David; Smyth, Cliff: Restricted Stirling and Lah number matrices and their inverses (2019)
  7. Gledel, Valentin; Parreau, Aline: Identification of points using disks (2019)
  8. Krasko, Evgeniy; Omelchenko, Alexander: Enumeration of $r$-regular maps on the torus. I: Rooted maps on the torus, the projective plane and the Klein bottle. Sensed maps on the torus (2019)
  9. Manes, K.; Tasoulas, I.; Sapounakis, A.; Tsikouras, P.: Counting pairs of noncrossing binary paths: a bijective approach (2019)
  10. Windisch, Tobias: The fiber dimension of a graph (2019)
  11. Ablinger, J.; Blümlein, J.; De Freitas, A.; van Hoeij, M.; Imamoglu, E.; Raab, C. G.; Radu, C.-S.; Schneider, C.: Iterated elliptic and hypergeometric integrals for Feynman diagrams (2018)
  12. Absil, Romain; Camby, Eglantine; Hertz, Alain; Mélot, Hadrien: A sharp lower bound on the number of non-equivalent colorings of graphs of order $n$ and maximum degree $n - 3$ (2018)
  13. a Campo, Frank: Relations between powers of Dedekind numbers and exponential sums related to them (2018)
  14. Adin, Ron M.; Bagno, Eli; Roichman, Yuval: Block decomposition of permutations and Schur-positivity (2018)
  15. Aidagulov, R. R.; Alekseyev, M. A.: On $p$-adic approximation of sums of binomial coefficients (2018)
  16. Alexandersson, Per; Panova, Greta: LLT polynomials, chromatic quasisymmetric functions and graphs with cycles (2018)
  17. Aliev, I.; De Loera, J. A.; Eisenbrand, Friedrich; Oertel, T.; Weismantel, Robert: The support of integer optimal solutions (2018)
  18. Al-Kaabi, Mahdi J. Hasan; Manchon, Dominique; Patras, Frédéric: Monomial bases and pre-Lie structure for free Lie algebras (2018)
  19. Alkan, Altug: On a generalization of Hofstadter’s $Q$-sequence: a family of chaotic generational structures (2018)
  20. Ashrafi, A. R.; Koorepazan-Moftakhar, F.: Towards the classification of finite simple groups with exactly three or four supercharacter theories (2018)

1 2 3 ... 132 133 134 next