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.

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

Table of values

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

List of values

[0, 1, 2, 0, 5, 6, 4, 9, 0, 14, 0, 18, 10, 7, 0, 26, 29, 30, 33, 0, 0, 0, 41, 0, 24, 50, 0, 53, 18, 14, 0, 65, 34, 69, 74, 0, 26, 81, 0, 86, 89, 90, 0, 48, 98, 0, 105, 0, 113, 38, 0, 0, 12, 25, 8, 0, 134, 0, 46, 35, 47, 146, 51, 0, 78, 158, 15, 0, 173, 174, 44, 0]