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.

A096635 Let p = n-th prime == 7 mod 8 (A007522); a(n) = smallest prime q such that p is not a square mod q.

Table of values

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

List of values

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