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.

A096634 Let p = n-th prime == 5 (mod 8) (A007521); a(n) = smallest prime q such that p is not a square mod q.

Table of values

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

List of values

[3, 5, 3, 5, 3, 7, 3, 11, 3, 5, 3, 7, 3, 7, 3, 5, 3, 3, 7, 5, 3, 5, 13, 3, 3, 11, 3, 5, 3, 7, 3, 3, 13, 5, 5, 3, 3, 3, 7, 5, 5, 3, 5, 3, 7, 3, 7, 5, 3, 5, 3, 5, 3, 5, 3, 3, 3, 11, 11, 5, 3, 13, 5, 3, 17, 3, 7, 5, 3, 3, 7, 11, 7, 3, 3, 5, 3, 3, 3, 7, 5, 3, 3, 3, 11, 3, 13, 5, 3, 3, 7, 3, 3, 11, 5, 3, 3, 5, 3]