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.

A049046 Number of k >= 1 with k! == 1 (mod n).

Table of values

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

List of values

[0, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 4, 1, 2, 1, 1, 1, 5, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 4, 1, 5, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 4, 1, 1, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 2, 1, 3, 1, 1]