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.

A077197 a(n) = lambda(phi(n)) where lambda(n) (A002322) is the Carmichael lambda function which gives the smallest integer m such that k^m = 1 mod n for all integers k relatively prime to n and phi(n) is A000010.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 4, 2, 6, 2, 2, 4, 10, 2, 4, 2, 6, 2, 6, 2, 4, 4, 4, 4, 2, 2, 6, 6, 2, 4, 4, 2, 6, 4, 2, 10, 22, 4, 6, 4, 8, 2, 12, 6, 4, 2, 6, 6, 28, 4, 4, 4, 6, 8, 4, 4, 10, 8, 10, 2, 12, 2, 6, 6, 4, 6, 4, 2, 12, 8, 18, 4, 40, 2, 16, 6, 6, 4, 10, 2, 6, 10, 4, 22, 6, 8]