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.

A218797 Number of ways to write 2n - 1 as p + q + r with p <= q <= r and p, q, r, p^2 + q^2 + r^2 all prime.

Table of values

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

List of values

[0, 0, 0, 1, 0, 1, 2, 1, 2, 0, 1, 2, 2, 1, 3, 2, 3, 1, 2, 1, 1, 2, 2, 2, 1, 2, 1, 2, 4, 1, 3, 2, 2, 2, 2, 2, 2, 4, 3, 3, 3, 2, 4, 4, 3, 0, 2, 1, 1, 1, 1, 2, 2, 3, 2, 4, 4, 3, 3, 2, 3, 4, 2, 2, 3, 2, 1, 3, 3, 1, 2, 2, 5, 1, 4, 2, 2, 1, 1, 6, 3, 1, 5, 1, 1, 5, 4, 1, 4, 1, 2, 6, 2, 4, 2, 2, 2, 1, 4, 4]