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.

A237413 Number of ways to write n = k + m with k > 0 and m > 0 such that p(k)^2 - 2, p(m)^2 - 2 and p(p(m))^2 - 2 are all prime, where p(j) denotes the j-th prime.

Table of values

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

List of values

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