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.

A096633 Let p = n-th prime == 3 mod 8 (A007520); a(n) = smallest prime q such that p is not a square mod q.

Table of values

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

List of values

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