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.

A387388 a(n) is the maximum number of ways in which any strict partition of 2n can be partitioned into two disjoint subsets of equal sum.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 2
12 2
13 2
14 4
15 4
16 4
17 4
18 7
19 6
20 6
21 6
22 6
23 11
24 11
25 10
26 10
27 10
28 19
29 18
30 18
31 18
32 17
33 35
34 33
35 32
36 32
37 31
38 31
39 62
40 60
41 58
42 57
43 57
44 55
45 56
46 108
47 105
48 103
49 101
50 100
51 100
52 99
53 195
54 191
55 187
56 184
57 182
58 181
59 180
60 361
61 352
62 344
63 340
64 336
65 333

List of values

[0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 4, 4, 4, 4, 7, 6, 6, 6, 6, 11, 11, 10, 10, 10, 19, 18, 18, 18, 17, 35, 33, 32, 32, 31, 31, 62, 60, 58, 57, 57, 55, 56, 108, 105, 103, 101, 100, 100, 99, 195, 191, 187, 184, 182, 181, 180, 361, 352, 344, 340, 336, 333]