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.

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

Table of values

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

List of values

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

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

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