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.

A198192 Replace 2^k in the binary representation of n with n-k (i.e. if n = 2^a + 2^b + 2^c + ... then a(n) = (n-a) + (n-b) + (n-c) + ...).

Table of values

n a(n)
0 0
1 1
2 1
3 5
4 2
5 8
6 9
7 18
8 5
9 15
10 16
11 29
12 19
13 34
14 36
15 54
16 12
17 30
18 31
19 52
20 34
21 57
22 59
23 85
24 41
25 68
26 70
27 100
28 75
29 107
30 110
31 145
32 27
33 61
34 62
35 99
36 65
37 104
38 106
39 148
40 72
41 115
42 117
43 163
44 122
45 170
46 173
47 224
48 87
49 138
50 140
51 194
52 145
53 201
54 204
55 263
56 156
57 216
58 219
59 282
60 226

List of values

[0, 1, 1, 5, 2, 8, 9, 18, 5, 15, 16, 29, 19, 34, 36, 54, 12, 30, 31, 52, 34, 57, 59, 85, 41, 68, 70, 100, 75, 107, 110, 145, 27, 61, 62, 99, 65, 104, 106, 148, 72, 115, 117, 163, 122, 170, 173, 224, 87, 138, 140, 194, 145, 201, 204, 263, 156, 216, 219, 282, 226]