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.

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

Table of values

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

List of values

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