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.

A046072 Decompose multiplicative group of integers modulo n as a product of cyclic groups C_{k_1} x C_{k_2} x ... x C_{k_m}, where k_i divides k_j for i < j; then a(n) = m.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 2, 3, 1, 2, 1, 2, 2, 1, 1, 3, 1, 1, 2, 2, 1, 1, 2, 3, 2, 1, 1, 3, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 3, 1, 1, 2, 2, 2, 2, 1, 3, 1, 1, 1, 3, 2, 1, 2, 3, 1, 2, 2, 2, 2, 1, 2, 3, 1, 1, 2, 2, 1, 2]