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.

A198193 Replace 2^k in the binary representation of n with n+(k-L) where L = floor(log(n)/log(2)).

Table of values

n a(n)
0 0
1 1
2 2
3 5
4 4
5 8
6 11
7 18
8 8
9 15
10 18
11 28
12 23
13 35
14 39
15 54
16 16
17 30
18 33
19 50
20 38
21 57
22 61
23 83
24 47
25 70
26 74
27 100
28 81
29 109
30 114
31 145
32 32
33 61
34 64
35 96
36 69
37 103
38 107
39 144
40 78
41 116
42 120
43 161
44 127
45 170
46 175
47 221
48 95
49 141
50 145
51 194
52 152
53 203
54 208
55 262
56 165
57 220
58 225
59 283

List of values

[0, 1, 2, 5, 4, 8, 11, 18, 8, 15, 18, 28, 23, 35, 39, 54, 16, 30, 33, 50, 38, 57, 61, 83, 47, 70, 74, 100, 81, 109, 114, 145, 32, 61, 64, 96, 69, 103, 107, 144, 78, 116, 120, 161, 127, 170, 175, 221, 95, 141, 145, 194, 152, 203, 208, 262, 165, 220, 225, 283]