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.

A240666 Least k such that k^m == -1 (mod prime(n)) has a solution for some m.

Table of values

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

List of values

[3, 2, 2, 3, 2, 2, 2, 2, 5, 2, 3, 2, 2, 2, 5, 2, 2, 2, 2, 7, 3, 3, 2, 3, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 5, 2, 2, 2, 7, 2, 2, 3, 2, 3, 2, 2, 3, 7, 2, 2, 2, 5, 2, 3, 2, 2, 2, 2, 2, 11, 2, 2, 2, 3, 2, 2, 2, 7, 3, 2, 2, 5, 2, 2, 2, 2, 2, 2, 7, 2, 3, 2, 2]

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

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