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.

A353768 a(n) = phi(n) mod 4; Euler totient function reduced modulo 4.

Table of values

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

List of values

[1, 1, 2, 2, 0, 2, 2, 0, 2, 0, 2, 0, 0, 2, 0, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 2, 2, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 2, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 2]

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

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