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.

A382954 Number of ways to partition distinct prime numbers into three 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 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 1
20 0
21 0
22 1
23 0
24 2
25 0
26 1
27 0
28 1
29 3
30 2
31 8
32 1
33 1
34 4
35 0
36 14
37 9
38 1
39 4
40 7
41 16
42 26
43 31
44 17
45 3
46 19
47 39
48 54
49 20
50 62
51 9
52 41
53 96
54 89
55 62
56 66
57 34
58 59
59 197
60 241
61 289
62 69
63 124
64 184
65 133
66 481
67 440
68 148
69 225
70 394
71 709
72 808
73 984
74 555
75 414
76 799

List of values

[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 1, 3, 2, 8, 1, 1, 4, 0, 14, 9, 1, 4, 7, 16, 26, 31, 17, 3, 19, 39, 54, 20, 62, 9, 41, 96, 89, 62, 66, 34, 59, 197, 241, 289, 69, 124, 184, 133, 481, 440, 148, 225, 394, 709, 808, 984, 555, 414, 799]