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.

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

List of values

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