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.

A330406 a(n) is the smallest prime q such that q^((p-1)/2) == -1 (mod p), where p = A002144(n) is the n-th prime congruent to 1 mod 4.

Table of values

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

List of values

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