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.

A020649 Least quadratic nonresidue modulo n (with n >= 3).

Table of values

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

List of values

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