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.

A285813 Let p_1 be primes such that 2*n-p_i is prime. a(n) is the smallest i such that 2*n+(odd part of p_i-1) is prime or a(n)=0 if there is no such i.

Table of values

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

List of values

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