Online Encyclopedia of Integer Sequences

OEIS solves real-world problems! One time I needed to optimize accesses to a data structure in my code. By trying out a few examples, I found the optimal order of iterations followed a particular number sequence, but I had no idea on how it could be deduced or calculated analytically. I entered the few examples I had into OEIS and found the solution. The solution involves graduate-level combinatorics and there was no way that I could solve it. Thanks Neil…

The best description of the OEIS I've heard is by Donald Knuth in this fun talk (https://youtu.be/BxQw4CdxLr8) where at 19:50 he says how it lets you "compute your way into the literature": > For the last 30 years or more, there has been a wonderful tool for all kinds of problems of this form and it's been online for a long time: we have the Online Encyclopedia of Integer Sequences. And this is just the nicest thing since sliced bread…

When you plot the "importance" N(n) of the positive integers, where N(n) = The number of occurrences of n in the OEIS an interesting anomaly appears[1]. The "importance" of the integers fall into two clusters, separated by Sloane's Gap[2][3]. Also, Neil Sloane appeared[4] several times on Numberphile. In the last few videos of that[4] playlist ("Amazing Graphs"), Sloane shares some of the particularly interesting sequences from the OEIS. [1] https://i.stack.imgur.com/vcNYb.png [2] https://arxiv.org/abs/1101.4470v2…

I had the honor of having lunch with Dr. Sloane once. By the end, the paper tablecloth was COVERED in sequences scrawled in pen. He was grinning and telling everyone at the table about different properties and new sequences being worked on. OEIS was awesome before that, but seeing how much he really, really loves sequences made it even better. You can feel the love between every comma.