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.

A387389 a(n) is the smallest positive integer for which there exists a strict partition that can be partitioned into two disjoint subsets with equal sum in n ways.

Table of values

n a(n)
1 6
2 22
3 32
4 28
5 40
6 38
7 36
8 52
9 50
10 48
11 46
12 66
13 64
14 64
15 62
16 62
17 60
18 58
19 56
20 80
21 80
22 78
23 78
24 76
25 78
26 76
27 74
28 74
29 72
30 72
31 70
32 70
33 68
34 96
35 66
36 96
37 94
38 96
39 92
40 94
41 92
42 92
43 90
44 92
45 90
46 88
47 88
48 90
49 86
50 88
51 86
52 86
53 84
54 84
55 84
56 82
57 82
58 82
59 80
60 80
61 110
62 78
63 112
64 114

List of values

[6, 22, 32, 28, 40, 38, 36, 52, 50, 48, 46, 66, 64, 64, 62, 62, 60, 58, 56, 80, 80, 78, 78, 76, 78, 76, 74, 74, 72, 72, 70, 70, 68, 96, 66, 96, 94, 96, 92, 94, 92, 92, 90, 92, 90, 88, 88, 90, 86, 88, 86, 86, 84, 84, 84, 82, 82, 82, 80, 80, 110, 78, 112, 114]