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.

A239202 Multiplicative order of phi(n) modulo n when gcd(phi(n),n)=1.

Table of values

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

List of values

[1, 1, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 10, 6, 2, 2, 2, 2, 8, 2, 2, 2, 12, 2, 22, 2, 2, 15, 2, 2, 4, 28, 2, 12, 36, 2, 2, 2, 2, 2, 2, 44, 48, 20, 2, 2, 18, 2, 2, 46, 6, 28, 2, 2, 2, 52, 22, 2, 2, 2, 58, 2, 2, 18, 80, 2, 2, 2, 2, 45, 2, 70, 28, 6, 48, 2, 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.