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.

A377059 a(n) is the smallest even r less than n-1 such that x^r = 1 (mod n) for the least x such that gcd(x,n)=1 for n >= 4 else 0.

Table of values

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

List of values

[0, 0, 0, 2, 2, 2, 2, 2, 6, 4, 2, 2, 6, 6, 4, 4, 8, 6, 6, 4, 6, 10, 2, 2, 20, 4, 18, 6, 14, 4, 6, 8, 10, 16, 12, 6, 18, 18, 12, 4, 20, 6, 14, 10, 12, 22, 2, 4, 42, 20, 8, 6, 26, 18, 20, 6, 18, 28, 2, 4, 10, 30, 6, 16, 12, 10, 22, 16, 22, 12, 10, 6, 12, 18, 20, 18]

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

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