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.

A096142 Let p(0) = 1, p(k) = k-th prime for k >= 1; write 2n = p(i) + p(j) with i <= j and i minimal; sequence gives i.

Table of values

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

List of values

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