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.

A053839 a(n) = (sum of digits of n written in base 4) modulo 4.

Table of values

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

List of values

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