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.

A103506 Smallest prime p such that 2n+1 = 2q + p for some odd prime q, or 0 if no such prime exists.

Table of values

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

List of values

[0, 0, 0, 3, 5, 3, 5, 3, 5, 7, 13, 3, 5, 3, 5, 7, 13, 3, 5, 3, 5, 7, 13, 3, 5, 7, 17, 11, 13, 3, 5, 3, 5, 7, 13, 11, 13, 3, 5, 7, 37, 3, 5, 3, 5, 7, 13, 3, 5, 7, 17, 11, 13, 3, 5, 7, 29, 11, 13, 3, 5, 3, 5, 7, 13, 11, 13, 3, 5, 7, 37, 3, 5, 3, 5, 7, 13, 11]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.