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.

A345674 Euler totient function phi(n) - number of primitive roots modulo n.

Table of values

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

List of values

[0, 0, 1, 1, 2, 1, 4, 4, 4, 2, 6, 4, 8, 4, 8, 8, 8, 4, 12, 8, 12, 6, 12, 8, 12, 8, 12, 12, 16, 8, 22, 16, 20, 8, 24, 12, 24, 12, 24, 16, 24, 12, 30, 20, 24, 12, 24, 16, 30, 12, 32, 24, 28, 12, 40, 24, 36, 16, 30, 16, 44, 22, 36, 32, 48, 20, 46, 32, 44, 24]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.