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.

A049802 a(n) = n mod 2 + n mod 4 + ... + n mod 2^k, where 2^k <= n < 2^(k+1).

Table of values

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

List of values

[0, 0, 1, 0, 2, 2, 4, 0, 3, 4, 7, 4, 7, 8, 11, 0, 4, 6, 10, 8, 12, 14, 18, 8, 12, 14, 18, 16, 20, 22, 26, 0, 5, 8, 13, 12, 17, 20, 25, 16, 21, 24, 29, 28, 33, 36, 41, 16, 21, 24, 29, 28, 33, 36, 41, 32, 37, 40, 45, 44, 49, 52, 57, 0, 6, 10, 16, 16]