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.

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

List of values

[0, 1, 2, 0, 5, 2, 4, 3, 0, 14, 0, 6, 10, 7, 0, 26, 29, 10, 11, 0, 0, 0, 41, 0, 8, 50, 0, 53, 6, 14, 0, 65, 34, 23, 74, 0, 26, 27, 0, 86, 89, 30, 0, 16, 98, 0, 35, 0, 113, 38, 0, 0, 4, 25, 8, 0, 134, 0, 46, 35, 47, 146, 17, 0, 26, 158, 5, 0, 173, 58, 44, 0, 0, 62]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.