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.

A236912 Number of partitions of n such that no part is a sum of two other parts.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 6
6 8
7 12
8 14
9 20
10 25
11 34
12 40
13 54
14 64
15 85
16 98
17 127
18 149
19 189
20 219
21 277
22 316
23 395
24 456
25 557
26 638
27 778
28 889
29 1070
30 1226
31 1461
32 1667
33 1978
34 2250
35 2645
36 3019
37 3521
38 3997
39 4652
40 5267
41 6093
42 6909
43 7943
44 8982
45 10291
46 11609
47 13251
48 14947
49 16984
50 19104

List of values

[1, 1, 2, 3, 4, 6, 8, 12, 14, 20, 25, 34, 40, 54, 64, 85, 98, 127, 149, 189, 219, 277, 316, 395, 456, 557, 638, 778, 889, 1070, 1226, 1461, 1667, 1978, 2250, 2645, 3019, 3521, 3997, 4652, 5267, 6093, 6909, 7943, 8982, 10291, 11609, 13251, 14947, 16984, 19104]