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.

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

Table of values

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

List of values

[0, 0, 1, 0, 0, 3, 2, 0, 0, 7, 0, 9, 5, 0, 0, 13, 0, 15, 0, 0, 0, 0, 0, 0, 12, 25, 0, 0, 9, 7, 0, 0, 17, 0, 37, 0, 13, 0, 0, 43, 0, 45, 0, 24, 49, 0, 0, 0, 0, 19, 0, 0, 6, 0, 4, 0, 67, 0, 23, 0, 0, 73, 0, 0, 39, 79, 0, 0, 0, 87, 22, 0, 0, 93, 0, 0, 97, 11, 50, 51]