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.

A227361 If n is even, then a(n) = n + bitsum(n), else a(n) = n - bitsum(n), where bitsum(n) is the count of binary 1's in n, A000120.

Table of values

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

List of values

[0, 0, 3, 1, 5, 3, 8, 4, 9, 7, 12, 8, 14, 10, 17, 11, 17, 15, 20, 16, 22, 18, 25, 19, 26, 22, 29, 23, 31, 25, 34, 26, 33, 31, 36, 32, 38, 34, 41, 35, 42, 38, 45, 39, 47, 41, 50, 42, 50, 46, 53, 47, 55, 49, 58, 50, 59, 53, 62, 54, 64, 56, 67, 57, 65, 63, 68, 64, 70, 66, 73, 67, 74, 70, 77, 71, 79, 73, 82, 74, 82, 78, 85, 79, 87, 81, 90, 82, 91, 85]