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.

A224963 Let p = prime(n). a(n) = number of primes q less than p, such that both p+q+1 and p+q-1 are primes.

Table of values

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

List of values

[0, 0, 0, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 1, 2, 2, 3, 2, 3, 1, 4, 2, 3, 5, 4, 3, 3, 5, 3, 6, 6, 4, 7, 3, 5, 5, 4, 5, 6, 4, 8, 4, 3, 4, 6, 6, 6, 3, 5, 5, 7, 6, 6, 2, 4, 6, 5, 2, 6, 5, 5, 5, 5, 3, 3, 8, 5, 4, 8, 4, 7, 4, 7, 7, 4, 7, 3, 5, 8, 9, 9, 6, 6, 7]