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.

A235649 Define a(4)=3 then a(n+1)is the smallest prime P such that a(n)<=P< n with 2*n-P=Q prime and if not possible a(n+1) is the smallest prime P such that P with 2*n-P=Q prime.

Table of values

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

List of values

[3, 3, 5, 3, 3, 5, 7, 3, 5, 7, 11, 11, 13, 3, 5, 7, 11, 11, 13, 17, 17, 19, 23, 23, 3, 5, 7, 19, 23, 23, 31, 3, 5, 7, 17, 17, 19, 23, 23, 3, 5, 7, 13, 23, 23, 31, 41, 41, 43, 47, 47, 3, 3, 5, 7, 11, 11, 13, 17, 17, 19, 23, 23, 31, 47, 59, 61, 3, 5, 7, 11]