Académique Documents
Professionnel Documents
Culture Documents
For more than 50 years, the mathematician Neil Sloane has curated the
authoritative collection of interesting and important integer sequences.
By: Erica Klarreich
August 6, 2015
The number of ways to arrange ncircles in a plane, with only two crossing at any given point, is sequence A250001 in the
OEIS.
The collection, which began in 1964 as a stack of handwritten index cards, gave rise to a
1973 book containing 2,372 sequences, and then a 1995 book, co-authored with
mathematicianSimon Plouffe, containing just over 5,000 sequences. By the following
year, so many people had submitted sequences to Sloane that the collection nearly
doubled in size, so he moved it onto the Internet. Since then, Sloane has personally
created entries for more than 170,000 sequences. Recently, however, hes had help
processing the torrent of submissions he receives each year from all over the world:
Since 2009 the collection has been run as a wiki, and it now boasts more than 100
volunteer editors.
But the OEIS is still very much Sloanes baby. He spends hours each day vetting new
submissions and adding sequences from archived papers and correspondence.
Quanta caught up with Sloane over Skype last month as he sorted through sequences in
his attic home office in Highland Park, N.J. Formerly a childrens playroom, its garish
wallpaper is tempered by giant stacks of papers, and, as Sloane put it, enough
computers so I dont need a heater. An edited and condensed version of the interview
follows.
QUANTA MAGAZINE: Tell me how you started the OEIS. Some sequences came
up in your research as a graduate student, right?
NEIL SLOANE: It was my thesis. I was looking into what are now called neural networks.
These are networks of [artificial] neurons, and each neuron fires or doesnt fire and is
connected to other neurons which fire or dont fire depending on the signal. I wanted to
know whether the activity in some of these networks was likely to die out or keep firing.
Some of the simplest cases gave rise to sequences. I took the simplest one and, with
some difficulty, worked out half a dozen terms. [It] goes 1, 8, 78, 944. I needed to
know how fast it grew, and I looked it up in the obvious places, and it wasnt there.
I started making a collection of sequences, so the next time this came up, Id have my
own table to look up. I made a little collection of file cards, and then they became
punched cards and then magnetic tape and eventually the book in 1973.
And when did you start sharing your collection with other people?
Oh, right away. I mean, within a year or two. The word got around, and you know, letters
started coming in. And as soon as the book came out, there was a flood of letters. Im
still going through the binders from that period. The project [now] is to sort through all
the interesting documents from the past, which now goes back 51 years. A lot of them
are in binders. A lot of them are not, unfortunately. Over there, theres about an eight- or
nine-feet stack of papers that havent been sorted.
Its very slow work. I have to go through these 50 binders and figure out whats worth
scanning, whats worth preserving, what is available online so we dont need to scan it.
But Im also finding lots of new sequences as I go along, that for one reason or another I
didnt include the first time around.
Besides the books about sequences, youve also co-authored two guidebooks
to rock climbing in New Jersey.
I did it with my climbing partner, Paul Nick. We spent a lot of time driving around New
Jersey climbing on crags and taking photographs and collecting route information. There
were a lot of restrictions. A lot of cliffs were on private property, so we couldnt officially
include them in the book.
Do you have any favorite mathematical discoveries that came about because
of the OEIS?
One of the most famous discoveries has to do with a formula discovered by Gregory, an
astronomer back in Newtons day, for /4. The formula says that /4 = 1 1/3 + 1/5 1/7
+ 1/9 and so on. Its a good way of computing if you dont have any better way. So
somebody did this, but wondered what would happen if you stopped after a while. So he
truncated the sum after 500,000 terms and looked at the number, and he worked it out
to many decimal places. He noticed, of course, that it was different from .
Sloane is discovering new integer sequences in unsorted stacks of documents collected over 51 years.
He looked at where it differed, and it differed after five decimal places. But then it agreed
for the next ten places, and then it disagreed for two decimal places. Then it agreed for
the next ten places, and then it disagreed. This was absolutely amazing, that it would
agree everywhere except at certain places.
Then I think it was Jonathan Borwein who looked at the differences [between and the
truncated sum]. When you subtract you get a sequence of numbers, and he looked it up
in the OEIS, and it wasnt there. But then he divided by 2 and looked it up, and there
they were. It was sequence A000364. It was the Euler numbers.
He and his two collaborators studied this, and they ended up with a formula for the error
term. If you truncate Gregorys series after not just 500,000 terms, but after n terms,
wheren can be anything you want, you can give an exact formula for the error.
It was absolutely miraculous that this was discovered. So, its a theorem that came into
existence because of the OEIS.
Tell me about some sequences you like. What makes a sequence appealing to
you?
Its a bit like saying, What makes a painting appealing? or What makes a piece of
music appealing? In the end, its just a matter of judgment, based on experience. If
there is some rule for generating the sequence which is a bit surprising, and the
sequence turns out to be not so easy to understand, that makes it interesting.
Theres a sequence of Leroy Quets which produces primes. It chugs along, but its like
Schrdingers cat; we dont know if it exists [as an infinitely long sequence] or not. I think
weve computed 600 million terms, and so far it hasnt died. It would be nicer or
maybe it would be less nice if we could actually analyze it.
How often do you get a new sequence that makes you say, I cant believe no
one has ever thought of this before?
This happens all the time. There are many gaps, even now. I fill in these gaps myself
quite often when I come across something in one of these old letters. Were a finite
community. Its easy to overlook even an obvious sequence.
To what extent is there a clear aesthetic about which sequences deserve to be
in the OEIS?
We have arguments about this, of course, because somebody will send in a sequence
that he or she thinks is wonderful, and we the editors, look at it and say, Well, thats
really not very interesting. Thats boring. Then the person who submitted it may get
really annoyed and say, No, no, youre wrong. I spent a lot of time on this sequence.
Its a matter of judgment, and in the end I have the final say. Of course, Im very
influenced by the other editors-in-chief.
One of our phrases is, This is too specialized. This is too arbitrary. This is not of general
interest. For instance, primes beginning with 1998 would not be so interesting. Too
specialized, too arbitrary, so that would be rejected.
It might not be rejected if it had been published somewhere if it was on a test, say. We
like to include sequences that appear on IQ tests. Its always been one of my goals to
help people do these silly tests.
One of the features on the OEIS is the option to listen to a sequence musically.
What do you think that adds?
Well, its another dimension of looking at the sequence. Some sequences, you get a good
feeling for them by listening to them. Some of the sequences almost sound like music.
Others just sound like rubbish.
Youve said that you think Bach would have loved the OEIS.
I think music is very mathematical, obviously, and so he would have appreciated the
OEIS. He would have understood it. He probably would have joined in, contributed some
sequences. Maybe he would have composed some pieces that we could use.
Do you have a sense of the magnitude of the OEIS impact?
Not really. I know its helped a lot of people, and its very famous. We have sequence
fans from all over the world. Youll see many references from unexpected places to the
OEIS: journals, books, theses from civil engineering or social studies that mention
sequences. They come up all over the place.
Are there other repositories of mathematical information that you wish
existed, but dont yet?
You would like an index to theorems, but its hard to imagine how that would work.
Were trying to get a collaboration going with the Zentralblatt the German equivalent
of Math Reviews MathSciNet about making it possible to search for formulas in the
OEIS. Suppose you want the summation of xn over n2 + 3, where the sum goes from one
to infinity. Its very hard to look that up in the OEIS at present.
Youre retired from AT&T Labs, but looking at your list of recent publications
and your activity with the OEIS, you seem anything but retired.
I have an office at Rutgers, and I give lectures there, and I have students, and Im even
busier back here in my study running the OEIS and doing research and going around the
world giving talks and so on. Im busier than ever.
There are more than 4,000 people registered on the OEIS website. They range
from professional mathematicians to recreational mathematicians, right?
A child just registered the other day, and said, Im ten years old, and Im very smart.
So its a wide-ranging group of people all over the world, from many different
occupations. One of the things people like about the OEIS is this opportunity to
collaborate, to exchange emails with professionals. Its one of the few opportunities that
most people have to talk to a real mathematician.
Do you feel that there is a divide between serious mathematics and
recreational mathematics? Or do you tend not to think in those terms?
I dont think in those terms. I dont think theres much difference. If you look hard
enough, you can find interesting mathematics anywhere.
A000125
1, 2,
1351,
6580,
15226
Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake):
C(n+1,3)+n+1.
(Formerly M1100 N0419)
4, 8, 15, 26, 42, 64, 93, 130, 176, 232, 299, 378, 470, 576, 697, 834, 988, 1160,
1562, 1794, 2048, 2325, 2626, 2952, 3304, 3683, 4090, 4526, 4992, 5489, 6018,
7176, 7807, 8474, 9178, 9920, 10701, 11522, 12384, 13288, 14235,
(list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Note that a(n) = a(n-1) + A000124(n-1). This has the following geometrical
interpretation: Define a number of planes in space to be in general
arrangement when
(1) no two planes are parallel,
(2) there are no two parallel intersection lines,
(3) there is no point common to four or more planes.
Suppose there are already n-1 planes in general arrangement, thus defining
the maximal number of regions in space obtainable by n-1 planes and now
one more plane is added in general arrangement. Then it will cut each of
the n-1 planes and acquire intersection lines which are in general
arrangement. (See the comments on A000124 for general arrangement with
62
REFERENCES
LINKS
lines.) These lines on the new plane define the maximal number of
regions in 2-space definable by n-1 straight lines, hence this
is A000124(n-1). Each of this regions acts as a dividing wall, thereby
creating as many new regions in addition to the a(n-1) regions already
there, hence a(n)=a(n-1)+A000124(n-1). - Peter C. Heinig
(algorithms(AT)gmx.de), Oct 19 2006
More generally, we have: A000027(n) = binomial(n,0) + binomial(n,1) (the
natural numbers), A000124(n) = binomial(n,0) + binomial(n,1) +
binomial(n,2) (the Lazy Caterer's sequence), a(n) = binomial(n,0) +
binomial(n,1) + binomial(n,2) + binomial(n,3) (Cake Numbers). - Peter C.
Heinig (algorithms(AT)gmx.de), Oct 19 2006
If Y is a 2-subset of an n-set X then, for n>=3, a(n-3) is the number of
3-subsets of X which have no exactly one element in common with Y.
- Milan Janjic, Dec 28 2007
a(n) is the number of compositions (ordered partitions) of n+1 into four
or fewer parts or equivalently the sum of the first four terms in the nth row of Pascal's triangle. - Geoffrey Critzer, Jan 23 2009
{a(k): 0 <= k < 4} = divisors of 8. - Reinhard Zumkeller, Jun 17 2009
a(n) is also the maximum number of different values obtained by summing n
consecutive positive integers with all possible 2^n sign combinations.
This maximum is first reached when summing the interval [n, 2n-1].
- Olivier Grard, Mar 22 2010
a(n) contains only 5 perfect squares > 1: 4, 64, 576, 676000, and
75203584. The incidences of > 0 are given by A047694. - Frank M Jackson,
Mar 15 2013
Given n tiles with two values - an A value and a B value - a player may
pick either the A value or the B value. The particular tiles are [n, 0],
[n-1, 1], ..., [2, n-2] and [1, n-1]. The sequence is the number of
different final A:B counts. For example, with n=4, we can have final
total [5, 3] = [4, _] + [_, 1] + [_, 2] + [1, _] = [_, 0] + [3, _] + [2,
_] + [_, 3], so a(4) = 2^4 - 1 = 15. The largest and smallest final A+B
counts are given by A077043 and A002620 respectively. -Jon Perry, Oct 24
2014
V. I. Arnold (ed.), Arnold's Problems, Springer, 2004, comments on Problem
1990-11 (p. 75), pp. 503-510. Numbers N_3.
R. B. Banks, Slicing Pizzas, Racing Turtles and Further Adventures in
Applied Mathematics, Princeton Univ. Press, 1999. See p. 27.
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 72, Problem 2.
H. E. Dudeney, Amusements in Mathematics, Nelson, London, 1917, page 177.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973
(includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences,
Academic Press, 1995 (includes this sequence).
T. H. Stickels, Mindstretching Puzzles. Sterling, NY, 1994 p. 85.
W. A. Whitworth, DCC Exercises in Choice and Chance, Stechert, NY, 1945,
p. 30.
A. M. Yaglom and I. M. Yaglom: Challenging Mathematical Problems with
Elementary Solutions. Vol. I. Combinatorial Analysis and Probability
Theory. New York: Dover Publications, Inc., 1987, p. 13, #45 (First
published: San Francisco: Holden-Day, Inc., 1964)
T. D. Noe, Table of n, a(n) for n=0..1000
A. M. Baxter, L. K. Pudwell, Ascent sequences avoiding pairs of patterns,
2014.
D. A. Lind, On a class of nonlinear binomial sums, Fib. Quart., 3 (1965),
292-298.
Svante Linusson, The number of M-sequences and f-vectors, Combinatorica,
vol 19 no 2 (1999) 255-266.
Alexsandar Petojevic, The Function vM_m(s; a; z) and Some Well-Known
Sequences, Journal of Integer Sequences, Vol. 5 (2002), Article 02.1.7
Simon Plouffe, Approximations de sries gnratrices et quelques
conjectures, Dissertation, Universit du Qubec Montral, 1992.
Simon Plouffe, 1031 Generating Functions and Conjectures, Universit du
FORMULA
EXAMPLE
MAPLE
A000125 := n->(n+1)*(n^2-n+6)/6;
MATHEMATICA
PROG
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
N. J. A. Sloane
EXTENSIONS
STATUS
approved
This article provides a list of integer sequences in the On-Line Encyclopedia of Integer Sequences that have their
ownWikipedia entries.
OEI
S
link
Name
First elements
Short description
A0000
10
Euler's totient
function (n)
1, 1, 2, 2, 4, 2, 6, 4, 6, 4
A0000
27
Natural number
1, 2, 3, 4, 5, 6, 7, 8, 9, 10
A0000
32
Lucas number
A0000
40
Prime number
A0000
45
Fibonacci number
0, 1, 1, 2, 3, 5, 8, 13, 21, 34
A0000
58
Sylvester's
sequence
A0000
73
Tribonacci
number
A0001
08
Catalan number
for n 0.
A0001
10
Bell number
OEI
S
link
Name
First elements
Short description
1385, 7936
A0001
24
Lazy caterer's
sequence
A0001
29
Pell number
A0001
42
Factorial
n! = 1234...n
A0002
17
Triangular number
A0002
92
Tetrahedral
number
A0003
30
Square pyramidal
number
Perfect number
A0006
68
Mersenne prime
2p 1 if p is a prime
A0075
88
Stella octangula
number
A0007
93
Landau's function
1, 1, 2, 3, 4, 6, 6, 12, 15, 20
A0007
96
Decimal
expansion of Pi
3, 1, 4, 1, 5, 9, 2, 6, 5, 3
A0009
31
Padovan sequence
1, 1, 1, 2, 2, 3, 4, 5, 7, 9
A0009
EuclidMullin
A0003
96
(n(n+1)(2n+1)) / 6
The number of stacked spheres in a pyramid with a square base
OEI
S
link
Name
First elements
Short description
45
sequence
6221671,
38709183810571, 139
A0009
59
Lucky number
A0010
06
Motzkin number
A0010
45
Jacobsthal number
A0010
65
sequence
ofAliquot
sumss(n)
0, 1, 1, 3, 1, 6, 1, 7, 4, 8
Decimal
A00111 expansion of e
3
(mathematical
constant)
2, 7, 1, 8, 2, 8, 1, 8, 2, 8
A0011
90
Wedderburn
Etherington
number
0, 1, 1, 1, 2, 3, 6, 11, 23, 46
A0013
58
Semiprime
A0014
62
Golomb sequence
1, 2, 2, 3, 3, 4, 4, 4, 5, 5
A0016
08
Perrin number
3, 0, 2, 3, 2, 5, 5, 7, 10, 12
A0016
20
EulerMascheroni
constant
5, 7, 7, 2, 1, 5, 6, 6, 4, 9
A0016
22
Decimal
expansion of
the golden ratio
1, 6, 1, 8, 0, 3, 3, 9, 8, 8
A0020
64
Cullen number
n 2n + 1
A0021
10
Primorial
A0021
13
Palindromic
number
0, 1, 2, 3, 4, 5, 6, 7, 8, 9
A number that remains the same when its digits are reversed
A0021
82
Highly composite
number
A0021
93
Decimal
expansion
ofsquare root of 2
1, 4, 1, 4, 2, 1, 3, 5, 6, 2
A0022
01
Superior highly
composite number
OEI
S
link
Name
First elements
Short description
A0023
78
Pronic number
n(n+1)
A0028
08
Composite
number
A0028
58
Ulam number
a(1) = 1; a(2) = 2; for n>2, a(n) = least number > a(n-1) which
is a unique sum of two distinct earlier terms; semiperfect
A0029
97
Carmichael
number
A0032
61
Woodall number
n 2n - 1
A0034
59
Permutable prime
A0050
44
Alcuin's sequence
0, 0, 0, 1, 0, 1, 1, 2, 1, 3, 2,
4, 3, 5, 4, 7, 5, 8, 7, 10, 8,
12, 10, 14
A0051
00
Deficient number
1, 2, 3, 4, 5, 7, 8, 9, 10, 11
A0051
01
Abundant number
A0051
50
Look-and-say
sequence
A0052
24
Aronson's
sequence
"t" is the first, fourth, eleventh, ... letter in this sentence, not
counting spaces or commas
A0052
35
Fortunate number
A0053
49
Harshad
numbers in base
10
1, 2, 3, 4, 5, 6, 7, 8, 9, 10,
12
A0053
84
Sophie Germain
prime
A0058
35
Semiperfect
number
A0060
37
Weird number
A0068
42
Farey
sequencenumerato
rs
0, 1, 0, 1, 1, 0, 1, 1, 2, 1
A0068
43
Farey
sequencedenomin
1, 1, 1, 2, 1, 1, 3, 2, 3, 1
OEI
S
link
Name
First elements
Short description
ators
A0068
62
Euclid number
A0068
86
Kaprekar number
A0073
04
Sphenic number
A0073
18
Pascal's triangle
1, 1, 1, 1, 2, 1, 1, 3, 3, 1
A0077
70
Happy number
A0100
60
ProuhetThue
Morse constant
0, 1, 1, 0, 1, 0, 0, 1, 1, 0
A0140
80
Factorion
1, 2, 145, 40585
A0145
77
Regular
paperfolding
sequence
1, 1, 0, 1, 1, 0, 0, 1, 1, 1
A0161
14
Circular prime
A0182
26
Magic number
(physics)
A0192
79
Superperfect
number
A0276
41
Bernoulli number
A0312
14
First elements in
1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1,
all OEISsequences 1, 1, 1, 1,
A0333
07
Decimal
expansion
ofChampernowne
constant
1, 2, 3, 4, 5, 6, 7, 8, 9, 1
A0355
13
Wythoff array
1, 2, 4, 3, 7, 6, 5, 11, 10, 9
A0362
62
Gilbreath's
conjecture
2, 1, 3, 1, 2, 5, 1, 0, 2, 7
A0372
74
Home prime
1, 2, 3, 211, 5, 23, 7,
3331113965338635107,
For n 2, a(n) = the prime that is finally reached when you start
withn, concatenate its prime factors (A037276) and repeat until
OEI
S
link
Name
First elements
Short description
311, 773
Undulating
number
A0502
78
Pandigital number
1023456789, 1023456798,
1023456879, 1023456897,
1023456978, 1023456987,
1023457689, 1023457698,
1023457869, 1023457896
Numbers containing the digits 0-9 such that each digit appears
exactly once
A0524
86
Achilles number
A0600
06
Decimal
expansion
ofPisot
Vijayaraghavan
number
1, 3, 2, 4, 7, 1, 7, 9, 5, 7
A0763
36
Sierpinski number
consists only of
A0763
37
Riesel number
consists only of
A0867
47
BaumSweet
sequence
1, 1, 0, 1, 1, 0, 0, 1, 0, 1
A0946
83
Juggler sequence
0, 1, 1, 5, 2, 11, 2, 18, 2, 27
A0979
42
Highly totient
number
A1002
64
Decimal
expansion
ofChaitin's
constant
0, 0, 7, 8, 7, 4, 9, 9, 6, 9
A1042
72
Ramanujan prime
A1220
45
Euler number
1, 0, 1, 0, 5, 0, 61, 0,
1385, 0
A0460
75