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.

A237667 Number of partitions of n such that no part is a sum of two or more other parts.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 6
6 7
7 11
8 12
9 17
10 19
11 29
12 28
13 41
14 42
15 61
16 61
17 87
18 85
19 120
20 117
21 160
22 156
23 224
24 216
25 288
26 277
27 380
28 363
29 483
30 474
31 622
32 610
33 783
34 755
35 994
36 986
37 1235
38 1191
39 1549
40 1483
41 1876
42 1865
43 2306
44 2279
45 2806
46 2732
47 3406
48 3413
49 4091
50 4013
51 4991
52 4895
53 5872

List of values

[1, 1, 2, 3, 4, 6, 7, 11, 12, 17, 19, 29, 28, 41, 42, 61, 61, 87, 85, 120, 117, 160, 156, 224, 216, 288, 277, 380, 363, 483, 474, 622, 610, 783, 755, 994, 986, 1235, 1191, 1549, 1483, 1876, 1865, 2306, 2279, 2806, 2732, 3406, 3413, 4091, 4013, 4991, 4895, 5872]