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.

A380482 a(n) is the multiplicative order of -3 modulo prime(n); a(2) = 0 for completion.

Table of values

n a(n)
1 1
2 0
3 4
4 3
5 10
6 6
7 16
8 9
9 22
10 28
11 15
12 9
13 8
14 21
15 46
16 52
17 58
18 5
19 11
20 70
21 12
22 39
23 82
24 88
25 48
26 100
27 17
28 106
29 54
30 112
31 63
32 130
33 136
34 69
35 148
36 25
37 39
38 81
39 166
40 172
41 178
42 90
43 190
44 16
45 196
46 99
47 105
48 111
49 226
50 114
51 232
52 238
53 120
54 250
55 256
56 262
57 268
58 15
59 138
60 280

List of values

[1, 0, 4, 3, 10, 6, 16, 9, 22, 28, 15, 9, 8, 21, 46, 52, 58, 5, 11, 70, 12, 39, 82, 88, 48, 100, 17, 106, 54, 112, 63, 130, 136, 69, 148, 25, 39, 81, 166, 172, 178, 90, 190, 16, 196, 99, 105, 111, 226, 114, 232, 238, 120, 250, 256, 262, 268, 15, 138, 280]