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

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

previous 1 2 3 ... 136 137 138 139 next

  1. Rains, E. M.; Sloane, N. J. A.: On Cayley’s enumeration of alkanes (or 4-valent trees) (1999)
  2. Schirmacher, Ernesto: Log-concavity and the exponential formula (1999)
  3. Sloane, N. J. A.: My favorite integer sequences (1999)
  4. Verhoeff, T.: Rectangular and trapezoidal arrangements (1999)
  5. Wilson, David W.: The fifth taxicab number is 48988659276962496 (1999)
  6. Winkel, Rudolf: An exponential formula for polynomial vector fields. II: Lie series, exponential substitution, and rooted trees (1999)
  7. Castillo, Jose: Smarandache continued fractions (1998)
  8. Conway, J. H.: On happy factorizations (1998)
  9. Dress, A.; Morgenstern, B.; Stoye, J.: The number of standard and of effective multiple alignments (1998)
  10. Duke, W.; Greenfield, Stephen J.; Speer, Eugene R.: Properties of a quadratic Fibonacci recurrence. (1998)
  11. Ekhad, Shalosh B.; Zeilberger, Doron: There are more than (2^n/17) (n)-letter ternary square-free words (1998)
  12. Fraenkel, Aviezri S.: Heap games, numeration systems and sequences (1998)
  13. Greenfield, Lawrence E.; Greenfield, Stephen J.: Some problems of combinatorial number theory related to Bertrand’s postulate (1998)
  14. Keith, Mike: On repdigit polygonal numbers (1998)
  15. McSorley, John P.: Counting structures in the Möbius ladder (1998)
  16. Pergola, Elisa; Sulanke, Robert A.: Schröder triangles, paths, and parallelogram polyominoes (1998)
  17. Plouffe, Simon: The computation of certain numbers using a ruler and compass (1998)
  18. Sommars, Steven E.; Sommars, Tim: The number of triangles formed by intersecting diagonals of a regular polygon (1998)
  19. Stevens, Gary E.: A Connell-like sequence (1998)
  20. Bernstein, M.; Sloane, N. J. A.; Wright, Paul E.: On sublattices of the hexagonal lattice (1997)

previous 1 2 3 ... 136 137 138 139 next