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.

A382871 Number of ways to partition distinct prime numbers into two disjoint sets such that the sum of each set equals n.

Table of values

n a(n)
0 1
1 0
2 0
3 0
4 0
5 1
6 0
7 1
8 0
9 0
10 0
11 0
12 0
13 1
14 1
15 1
16 1
17 1
18 2
19 3
20 3
21 2
22 3
23 4
24 6
25 2
26 5
27 0
28 5
29 9
30 7
31 14
32 8
33 6
34 10
35 9
36 21
37 19
38 11
39 18
40 15
41 29
42 34
43 35
44 34
45 24
46 31
47 51
48 55
49 48
50 76
51 34
52 60
53 93
54 89
55 97
56 91
57 76
58 83
59 156
60 164
61 189
62 145
63 157
64 172
65 186
66 283
67 276
68 218
69 242
70 280
71 405
72 433
73 476
74 446

List of values

[1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 3, 3, 2, 3, 4, 6, 2, 5, 0, 5, 9, 7, 14, 8, 6, 10, 9, 21, 19, 11, 18, 15, 29, 34, 35, 34, 24, 31, 51, 55, 48, 76, 34, 60, 93, 89, 97, 91, 76, 83, 156, 164, 189, 145, 157, 172, 186, 283, 276, 218, 242, 280, 405, 433, 476, 446]