An anonymous reader writes: Neil Sloane is considered by some to be one of the most influential mathematicians of our time.
That’s not because of any particular theorem the 75-year-old Welsh native has proved, though over the course of a more than 40-year research career at Bell Labs (later AT&T Labs) he won numerous awards for papers in the fields of combinatorics, coding theory, optics and statistics. Rather, it’s because of the creation for which he’s most famous: the Online Encyclopedia of Integer Sequences (OEIS), often simply called “Sloane” by its users.
This giant repository, which celebrated its 50th anniversary last year, contains more than a quarter of a million different sequences of numbers that arise in different mathematical contexts, such as the prime numbers (2, 3, 5, 7, 11 ) or the Fibonacci sequence (0, 1, 1, 2, 3, 5, 8, 13 ). What’s the greatest number of cake slices that can be made with n cuts? Look up sequence A000125 in the OEIS. How many chess positions can be created in n moves? That’s sequence A048987. The number of ways to arrange n circles in a plane, with only two crossing at any given point, is A250001. That sequence just joined the collection a few months ago. So far, only its first four terms are known; if you can figure out the fifth, Sloane will want to hear from you.