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.

A274021 Least positive x < n-1 such that x^y == -1 (mod n) for some y > 1, or 0 if no such x exist.

Table of values

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

List of values

[0, 0, 0, 0, 2, 0, 3, 0, 2, 3, 2, 0, 2, 3, 0, 0, 2, 5, 2, 0, 5, 7, 5, 0, 2, 5, 2, 3, 2, 0, 3, 0, 2, 3, 19, 11, 2, 3, 17, 0, 2, 5, 2, 7, 14, 5, 5, 0, 3, 3, 0, 23, 2, 5, 19, 31, 2, 3, 2, 0, 2, 3, 5, 0, 2, 17, 2, 0, 5, 19, 7, 23, 3, 3, 14, 3, 6, 17, 3, 0, 2, 3, 2, 47, 13, 3, 5, 7, 3, 29, 10]