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.

A049804 a(n) = n mod 4 + n mod 16 + ... + n mod 4^k, where 4^k <= n < 4^(k+1).

Table of values

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

List of values

[0, 0, 0, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 2, 4, 6, 4, 6, 8, 10, 8, 10, 12, 14, 12, 14, 16, 18, 0, 2, 4, 6, 4, 6, 8, 10, 8, 10, 12, 14, 12, 14, 16, 18, 0, 2, 4, 6, 4, 6, 8, 10, 8, 10, 12, 14, 12, 14, 16, 18, 0, 3, 6, 9, 8, 11, 14, 17, 16, 19, 22]