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.

A240658 Least k such that 3^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 3
5 0
6 0
7 8
8 9
9 0
10 14
11 15
12 9
13 4
14 21
15 0
16 26
17 0
18 5
19 11
20 0
21 6
22 39
23 0
24 44
25 24
26 50
27 17
28 0
29 0
30 56
31 63
32 0
33 68
34 69
35 74
36 25
37 39
38 81
39 0
40 86
41 0
42 0
43 0
44 8
45 98
46 99
47 105
48 111
49 0
50 0
51 116
52 0
53 60
54 0
55 128
56 0
57 134
58 15
59 0
60 140
61 141
62 146
63 17
64 0
65 0
66 158
67 165
68 84
69 0
70 87
71 176
72 0

List of values

[1, 0, 2, 3, 0, 0, 8, 9, 0, 14, 15, 9, 4, 21, 0, 26, 0, 5, 11, 0, 6, 39, 0, 44, 24, 50, 17, 0, 0, 56, 63, 0, 68, 69, 74, 25, 39, 81, 0, 86, 0, 0, 0, 8, 98, 99, 105, 111, 0, 0, 116, 0, 60, 0, 128, 0, 134, 15, 0, 140, 141, 146, 17, 0, 0, 158, 165, 84, 0, 87, 176, 0]