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.

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

Table of values

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

List of values

[1, 0, 1, 0, 0, 0, 4, 0, 0, 7, 0, 0, 2, 0, 0, 13, 0, 0, 0, 0, 3, 0, 0, 22, 12, 25, 0, 0, 0, 28, 0, 0, 34, 0, 37, 0, 0, 0, 0, 43, 0, 0, 0, 4, 49, 0, 0, 0, 0, 0, 58, 0, 30, 0, 64, 0, 67, 0, 0, 70, 0, 73, 0, 0, 0, 79, 0, 42, 0, 0, 88, 0, 0, 0, 0, 0, 97, 0, 100, 51, 0]