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.

A218754 Number of ways to write n=p+q(3+(-1)^n)/2 with q<=n/2 and p, q, p^2+3pq+q^2 all prime.

Table of values

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

List of values

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