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.

A275768 a(n) is the number of ways to express n = (prime(i) + prime(j))/2 when (prime(i) - prime(j))/2 also is prime.

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 2, 1, 2, 0, 2, 0, 1, 1, 2, 0, 3, 0, 2, 1, 1, 0, 5, 0, 1, 0, 0, 0, 5, 0, 1, 0, 1, 0, 5, 0, 0, 1, 1, 0, 6, 0, 1, 1, 1, 0, 5, 0, 2, 0, 0, 0, 5, 0, 2, 0, 0, 0, 10, 0, 0, 0, 1, 0, 8, 0, 0, 1, 2, 0, 6, 0, 0, 0, 2, 0, 8, 0, 0, 1]