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.

A248972 a(n) is the smallest b such that b^((p-1)/2) == -1 (mod p) where p = A080076(n) is the n-th Proth prime.

Table of values

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

List of values

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