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.

A094929 Let p = n-th prime; a(n) = smallest odd prime q such that p is not a square mod q.

Table of values

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

List of values

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