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.

A219252 Smallest prime q such that 2*n+1 = p + 4*q for some odd prime p, otherwise 0 if no such q exists.

Table of values

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

List of values

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