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

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

1 2 3 ... 127 128 129 next

  1. 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)
  2. a Campo, Frank: Relations between powers of Dedekind numbers and exponential sums related to them (2018)
  3. Asinowski, Andrei; Bacher, Axel; Banderier, Cyril; Gittenberger, Bernhard: Analytic combinatorics of lattice paths with forbidden patterns: enumerative aspects (2018)
  4. Avendaño, Martín; Kogan, Roman; Nisse, Mounir; Rojas, J. Maurice: Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces (2018)
  5. Baake, Michael; Coons, Michael: A natural probability measure derived from Stern’s diatomic sequence (2018)
  6. Bach, Eric; Dusart, Jérémie; Hellerstein, Lisa; Kletenik, Devorah: Submodular goal value of Boolean functions (2018)
  7. Barghi, Amir: Stirling numbers of the first kind for graphs (2018)
  8. Baril, Jean-Luc; Kirgizov, Sergey; Petrossian, Armen: Dyck paths with a first return decomposition constrained by height (2018)
  9. Barnard, Emily; Reading, Nathan: Coxeter-bicatalan combinatorics (2018)
  10. Barrientos, Christian; Minion, Sarah: On the number of $\alpha$-labeled graphs (2018)
  11. Barry, Paul; Mesinga Mwafise, Arnauld: Classical and semi-classical orthogonal polynomials defined by Riordan arrays, and their moment sequences (2018)
  12. Behan, Connor: Conformal manifolds: ODEs from OPEs (2018)
  13. Benkart, Georgia; Elduque, Alberto: Cross products, invariants, and centralizers (2018)
  14. Benkart, Georgia; Moon, Dongho: Walks on graphs and their connections with tensor invariants and centralizer algebras (2018)
  15. Bényi, Beáta; Nagy, Gábor V.: Bijective enumerations of $\Gamma$-free $0$-$1$ matrices (2018)
  16. Bevan, David; Homberger, Cheyne; Tenner, Bridget Eileen: Prolific permutations and permuted packings: downsets containing many large patterns (2018)
  17. Billey, Sara C.; Konvalinka, Matjaž; Petersen, T. Kyle; Slofstra, William; Tenner, Bridget E.: Parabolic double cosets in Coxeter groups (2018)
  18. Birmajer, Daniel; Gil, Juan B.; Weiner, Michael D.: On factor-free Dyck words with half-integer slope (2018)
  19. Boldi, Paolo; Vigna, Sebastiano: On the lattice of antichains of finite intervals (2018)
  20. Bras-Amorós, Maria; Fernández-González, Julio: Computation of numerical semigroups by means of seeds (2018)

1 2 3 ... 127 128 129 next