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.

A220419 Number of ways to write n=x+y (x>0, y>0) with 2x+1, 2y-1 and x^3+2y^3 all prime.

Table of values

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

List of values

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