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.

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

Table of values

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

List of values

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