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.

A178830 Number of distinct partitions of {1,...,n} into two nonempty sets P and S with the product of the elements of P equal to the sum of elements in S.

Table of values

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

List of values

[0, 0, 1, 0, 1, 1, 1, 1, 1, 3, 1, 2, 1, 3, 3, 3, 3, 1, 4, 4, 3, 2, 2, 4, 3, 5, 3, 2, 4, 5, 4, 5, 6, 1, 4, 2, 5, 4, 7, 4, 4, 3, 3, 6, 14, 3, 4, 10, 6, 3, 6, 4, 4, 4, 8, 7, 6, 8, 7, 10, 5, 11, 8, 5, 11, 4, 7, 7, 5, 8, 12, 5, 6, 9, 8, 11, 8, 5, 8, 9, 8, 10, 8, 12, 7, 11, 8, 7, 7, 8, 6, 7, 8, 11, 8, 16, 9, 12, 13, 8]