OEIS

Some number sequences follow a rule. With 2, 4, 6, 8 you spot it right away. With 1, 1, 2, 5, 14, 42, on the other hand, you don’t. For exactly such cases there is the OEIS. The abbreviation stands for On-Line Encyclopedia of Integer Sequences, in other words an online encyclopedia of integer sequences. You type in the first numbers of a series and get back whether and where this series has already appeared. The American mathematician Neil Sloane began the collection in 1964 on index cards. Today it is a free website with more than 380,000 entries.

A search engine for numbers instead of words

Anyone who does research or programs keeps running into number series that fall out of a calculation. For example, you count in how many ways a problem can be solved, and get 1, 2, 5, 14, 42. Without the OEIS that would remain a dead end. With it, you find out in seconds: those are the Catalan numbers, well studied since the 19th century.

The benefit lies in the fact that completely different questions can lead to the same sequence. An entry in the OEIS then connects fields that at first glance have nothing to do with each other. A computer scientist suddenly sees that his counting problem was solved long ago by combinatorists. Finding such cross-connections is the real value of the database.

For AI systems the OEIS is interesting for a different reason. It is one of the few large collections with cleanly verified mathematical facts. That is why it is used as test material: can a model guess the rule behind a sequence it has never seen? This tests genuine reasoning and not merely rote memorization.

What is in an A-entry

Every sequence has a fixed identifier that begins with an A. The Fibonacci sequence is A000045, the primes are A000040. This number never changes and is cited in academic papers like a source reference. It is thus a kind of ID card for number sequences.

An entry contains far more than just the numbers themselves. This includes a description in words, formulas, references to academic literature, and links to related sequences. Short programs are often included as well, which can be used to calculate further terms. So you can not only look up a sequence, but also continue it yourself.

The search works more robustly than one might expect. The database ignores sign and starting point and finds a sequence even if you jump in partway through it. Anyone may propose new entries, but they are checked beforehand by volunteers. The OEIS is therefore not a wiki in the usual sense, but an editorially curated collection.

From the school notebook to the model benchmark

In everyday life the OEIS is mainly encountered by people who work with numbers. That ranges from students facing a competition problem to physicists who cannot interpret a series from a simulation. The typical process is always the same: enter numbers, read the hits, keep working. Many users describe this as the fastest shortcut in mathematics.

In tech news the OEIS usually comes up in connection with AI. Companies and research groups test language models on whether they can recognize patterns in unknown sequences. This is tricky because the database is freely available online and may have been read during training. A good test must therefore use sequences that were added after the training cutoff.

A common misconception is that the OEIS contains all possible number sequences. It cannot, because there are infinitely many of them. Only what actually occurs somewhere and is documented gets included. So no hit does not mean the sequence is wrong. It only means that so far no one has found it interesting enough.