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.

A139366 Table with the order r=r(N,n) of n modulo N, for given N and n, with gcd(N,n)=1.

Table of values

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

List of values

[0, 1, 0, 1, 2, 0, 1, 0, 2, 0, 1, 4, 4, 2, 0, 1, 0, 0, 0, 2, 0, 1, 3, 6, 3, 6, 2, 0, 1, 0, 2, 0, 2, 0, 2, 0, 1, 6, 0, 3, 6, 0, 3, 2, 0, 1, 0, 4, 0, 0, 0, 4, 0, 2, 0, 1, 10, 5, 5, 5, 10, 10, 10, 5, 2, 0, 1, 0, 0, 0, 2, 0, 2, 0, 0, 0, 2, 0, 1, 12, 3, 6, 4, 12, 12, 4, 3, 6, 12, 2, 0, 1, 0, 6, 0, 6, 0, 0, 0, 3, 0]