cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A111133 Number of partitions of n into at least two distinct parts.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 1
5 2
6 3
7 4
8 5
9 7
10 9
11 11
12 14
13 17
14 21
15 26
16 31
17 37
18 45
19 53
20 63
21 75
22 88
23 103
24 121
25 141
26 164
27 191
28 221
29 255
30 295
31 339
32 389
33 447
34 511
35 584
36 667
37 759
38 863
39 981
40 1112
41 1259
42 1425
43 1609
44 1815
45 2047
46 2303
47 2589
48 2909
49 3263
50 3657
51 4096
52 4581
53 5119
54 5717
55 6377

List of values

[0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 9, 11, 14, 17, 21, 26, 31, 37, 45, 53, 63, 75, 88, 103, 121, 141, 164, 191, 221, 255, 295, 339, 389, 447, 511, 584, 667, 759, 863, 981, 1112, 1259, 1425, 1609, 1815, 2047, 2303, 2589, 2909, 3263, 3657, 4096, 4581, 5119, 5717, 6377]