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.

A237367 Number of ordered ways to write n = k + m with k > 0 and m > 0 such that 2*k - 1, prime(k)^2 - 2 and prime(m)^2 - 2 are all prime.

Table of values

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

List of values

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