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.

A244796 Number of moduli m such that (prime(n) mod m) = 1.

Table of values

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

List of values

[0, 1, 2, 3, 3, 5, 4, 5, 3, 5, 7, 8, 7, 7, 3, 5, 3, 11, 7, 7, 11, 7, 3, 7, 11, 8, 7, 3, 11, 9, 11, 7, 7, 7, 5, 11, 11, 9, 3, 5, 3, 17, 7, 13, 8, 11, 15, 7, 3, 11, 7, 7, 19, 7, 8, 3, 5, 15, 11, 15, 7, 5, 11, 7, 15, 5, 15, 19, 3, 11, 11, 3, 7, 11, 15, 3, 5, 17]