To find out, I turned to one of my favorite resources on the web: Neil Sloane’s On-Line Encyclopedia of Integer Sequences (OEIS). Sloane has spent more than 40 years amassing a vast database of known integer sequences, now totaling close to 200,000 entries.
Entering the sequence 2, 3, 4, 6, 7, 8, 11, 12 in the search box, for example, yields five results—known sequences that contain this particular string of consecutive integers. One is the sequence defined as follows: If n is in the sequence, then so are 2n and 4n – 1. Sloane’s entry provides information on how that particular sequence arose, along with comments, formulas, references to the literature, links to other websites, related sequences, and computer programs. You can even graph or listen to it!
However, if I were to extend the sequence by one term, adding 13, no match turns up.
I also use Sloane’s database to find interesting properties of individual numbers, just by entering a single number in the search box. Entering 2658, for instance, generates 42 results. One result reveals that 2658 is the number of 8-digit numbers in base 6 with adjacent digits differing by 1 or less. I’m not sure why anyone would want to know that, but there it is.
Sloane was at the Joint Mathematics Meetings in January, promoting the transition of his indispensible database from essentially a one-man operation to a wiki format at oeis.org, giving each sequence its own web page. A board of 50 associate editors will moderate submissions, relieving Sloane of much of the burden of checking new sequence submissions, which come in at a rate of more than 50 a day, and making all the necessary changes to web pages.
Sloane has set up the non-profit OEIS Foundation as owner of the database.
Cipra, B. 2010. What comes next? Science 327(Feb. 19):943.
Peterson, I. 2003. Sequence puzzles. Ivars Peterson’s MathTrek (May 19).
______. 2002. The EKG sequence. Ivars Peterson’s MathTrek (April 8).