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.

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

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 1
6 4
7 4
8 10
9 13
10 23
11 27
12 49
13 60
14 93
15 115
16 170
17 210
18 300
19 370
20 510
21 632
22 846
23 1031
24 1359
25 1670
26 2159
27 2630
28 3355
29 4082
30 5130
31 6220
32 7739
33 9360
34 11555
35 13889
36 16991
37 20402
38 24824
39 29636
40 35855
41 42707
42 51309
43 60955
44 72896
45 86328
46 102826
47 121348

List of values

[0, 0, 0, 0, 1, 1, 4, 4, 10, 13, 23, 27, 49, 60, 93, 115, 170, 210, 300, 370, 510, 632, 846, 1031, 1359, 1670, 2159, 2630, 3355, 4082, 5130, 6220, 7739, 9360, 11555, 13889, 16991, 20402, 24824, 29636, 35855, 42707, 51309, 60955, 72896, 86328, 102826, 121348]