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.

A144294 Let k = n-th nonsquare = A000037(n); then a(n) = smallest prime p such that k is not a square mod p.

Table of values

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

List of values

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