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.

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 0, 2, 2, 3, 2, 2, 3, 2, 3, 3, 2, 2, 0, 5, 2, 3, 2, 2, 3, 2, 3, 3, 2, 3, 7, 2, 2, 7, 5, 2, 3, 2, 2, 3, 5, 2, 3, 2, 5, 3, 2, 3, 7, 5, 2, 7, 2, 2, 3, 2, 2, 3, 2, 3, 3, 7, 3, 7, 5, 2, 7, 2, 5, 3, 2, 2, 7, 7, 3, 3, 2, 2, 7, 5, 2]

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

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