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.

A213237 Number of distinct values v satisfying v = sum of elements in S = product of elements in P for any partition of {1,...,n} into two sets S and P.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 1
6 1
7 1
8 1
9 1
10 2
11 1
12 2
13 1
14 3
15 3
16 2
17 3
18 1
19 2
20 3
21 3
22 2
23 2
24 4
25 3
26 5
27 3
28 2
29 3
30 3
31 4
32 4
33 5
34 1
35 3
36 2
37 4
38 4
39 6
40 3
41 3
42 2
43 3
44 4
45 9
46 3
47 4
48 9
49 4
50 3
51 5
52 4
53 4
54 4
55 6
56 6
57 5
58 5
59 4
60 7
61 4
62 8
63 6
64 4
65 7
66 3
67 6
68 5
69 3
70 4
71 6
72 5
73 4
74 6
75 6
76 5
77 7
78 4
79 6
80 9
81 7
82 6
83 6
84 8
85 4
86 7
87 5

List of values

[1, 0, 1, 0, 1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 3, 2, 3, 1, 2, 3, 3, 2, 2, 4, 3, 5, 3, 2, 3, 3, 4, 4, 5, 1, 3, 2, 4, 4, 6, 3, 3, 2, 3, 4, 9, 3, 4, 9, 4, 3, 5, 4, 4, 4, 6, 6, 5, 5, 4, 7, 4, 8, 6, 4, 7, 3, 6, 5, 3, 4, 6, 5, 4, 6, 6, 5, 7, 4, 6, 9, 7, 6, 6, 8, 4, 7, 5]