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.

A219604 Smallest prime p such that 2n+1 = 4q + 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 0
5 3
6 5
7 3
8 5
9 7
10 13
11 3
12 5
13 7
14 17
15 3
16 5
17 7
18 17
19 11
20 13
21 23
22 17
23 3
24 5
25 7
26 41
27 3
28 5
29 7
30 17
31 11
32 13
33 23
34 17
35 3
36 5
37 7
38 0
39 3
40 5
41 7
42 17
43 11
44 13
45 23
46 17
47 3
48 5
49 7
50 73
51 11
52 13
53 31
54 17
55 19
56 37
57 23
58 41
59 3
60 5
61 7
62 73
63 3
64 5
65 7
66 17
67 11
68 13
69 23
70 17
71 19
72 29
73 23
74 73
75 3

List of values

[0, 0, 0, 0, 3, 5, 3, 5, 7, 13, 3, 5, 7, 17, 3, 5, 7, 17, 11, 13, 23, 17, 3, 5, 7, 41, 3, 5, 7, 17, 11, 13, 23, 17, 3, 5, 7, 0, 3, 5, 7, 17, 11, 13, 23, 17, 3, 5, 7, 73, 11, 13, 31, 17, 19, 37, 23, 41, 3, 5, 7, 73, 3, 5, 7, 17, 11, 13, 23, 17, 19, 29, 23, 73, 3]

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

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