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.

A261872 a(n) = phi(n) mod 5, where phi is the Euler totient function.

Table of values

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

List of values

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