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.

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

Table of values

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

List of values

[0, 0, 0, 1, 5, 6, 8, 0, 0, 7, 3, 2, 20, 0, 0, 13, 29, 30, 0, 0, 18, 39, 41, 44, 6, 5, 51, 53, 54, 56, 63, 65, 68, 0, 0, 75, 78, 0, 0, 0, 89, 30, 0, 48, 7, 99, 0, 111, 113, 114, 116, 0, 10, 125, 128, 0, 67, 135, 138, 28, 0, 73, 0, 0, 26, 79, 0, 28, 173, 58, 16]