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.

A103153 a(n) is the smallest odd prime p such that 2*n+1 = 2*p + A000040(k) for some k>1, or 0 if no such prime exists.

Table of values

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

List of values

[0, 0, 0, 3, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 7, 5, 3, 3, 5, 5, 3, 7, 3, 3, 5, 3, 7, 5, 3, 7, 5, 3, 3, 5, 5, 3, 7, 3, 3, 5, 5, 3, 7, 3, 19, 5, 3, 7, 5, 11, 3, 11, 3, 3, 5, 3, 3, 5, 3, 7, 5, 11, 7, 11, 11, 3, 11, 3, 13, 5, 3, 3, 5, 5, 7, 7, 3, 3, 5, 5, 3, 7, 5, 3, 7, 3, 13, 5, 3, 7, 5, 3, 3, 5, 5, 7, 7, 3]