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.

A240662 Least k such that 7^k == -1 (mod prime(n)), or 0 if no such k exists.

Table of values

n a(n)
1 1
2 0
3 2
4 0
5 5
6 6
7 8
8 0
9 11
10 0
11 0
12 0
13 20
14 3
15 0
16 13
17 0
18 30
19 33
20 35
21 12
22 39
23 0
24 44
25 48
26 50
27 0
28 53
29 0
30 7
31 63
32 0
33 34
34 0
35 37
36 75
37 26
38 81
39 0
40 86
41 89
42 6
43 5
44 12
45 49
46 0
47 105
48 0
49 0
50 114
51 58
52 119
53 120
54 0
55 128
56 131
57 134
58 0
59 69
60 10
61 0
62 146
63 0
64 0
65 52
66 79
67 55
68 28
69 173
70 174
71 16

List of values

[1, 0, 2, 0, 5, 6, 8, 0, 11, 0, 0, 0, 20, 3, 0, 13, 0, 30, 33, 35, 12, 39, 0, 44, 48, 50, 0, 53, 0, 7, 63, 0, 34, 0, 37, 75, 26, 81, 0, 86, 89, 6, 5, 12, 49, 0, 105, 0, 0, 114, 58, 119, 120, 0, 128, 131, 134, 0, 69, 10, 0, 146, 0, 0, 52, 79, 55, 28, 173, 174, 16]