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.

A302257 Number of minimal generating sets {x_1, x_2, ..., x_r} of (Z/nZ)* such that Product_{i=1..r} (x_i)^(e_i) == 1 (mod n) implies that (x_i)^(e_i) == 1 (mod n) for 1 <= i <= r. Here (Z/nZ)* is the multiplicative group of integers modulo n.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 2, 3, 2, 2, 4, 3, 4, 2, 8, 8, 8, 2, 6, 8, 12, 4, 10, 28, 8, 4, 6, 12, 12, 8, 8, 16, 24, 8, 32, 12, 12, 6, 32, 96, 16, 12, 12, 24, 32, 10, 22, 96, 12, 8, 32, 32, 24, 6, 64, 168, 36, 12, 28, 96, 16, 8, 144, 32, 192, 24, 20, 32, 60, 32, 24, 168, 24, 12, 64, 36, 96, 32]