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.

A377938 a(n) is the least k > n such that n is a primitive root modulo k, or -1 if there is no such k.

Table of values

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

List of values

[2, 3, 4, -1, 6, 11, 10, 11, -1, 17, 13, 17, 19, 17, 19, -1, 22, 29, 22, 23, 23, 25, 25, 31, -1, 29, 29, 41, 34, 41, 34, 37, 38, 41, 37, -1, 46, 47, 47, 47, 47, 59, 46, 47, 47, 67, 49, 53, -1, 53, 53, 59, 62, 59, 58, 59, 67, 73, 61, 73, 67, 71, 67, -1, 71, 79, 71, 71, 71, 79, 82, 83, 83, 79, 79]