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.

A331176 a(n) = n - n/gcd(n, phi(n)), where phi is Euler totient function.

Table of values

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

List of values

[0, 0, 0, 2, 0, 3, 0, 6, 6, 5, 0, 9, 0, 7, 0, 14, 0, 15, 0, 15, 14, 11, 0, 21, 20, 13, 24, 21, 0, 15, 0, 30, 0, 17, 0, 33, 0, 19, 26, 35, 0, 35, 0, 33, 30, 23, 0, 45, 42, 45, 0, 39, 0, 51, 44, 49, 38, 29, 0, 45, 0, 31, 56, 62, 0, 33, 0, 51, 0, 35, 0, 69, 0, 37, 60, 57, 0, 65, 0, 75, 78, 41, 0, 77, 0, 43, 0, 77, 0, 75]