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.

A266151 Take the binary representation of n, increase each run of 1's by one 1 if the length of run is odd, otherwise, if length of run is even, remove one 1. a(n) is the decimal equivalent of the result.

Table of values

n a(n)
0 0
1 3
2 6
3 1
4 12
5 27
6 2
7 15
8 24
9 51
10 54
11 13
12 4
13 11
14 30
15 7
16 48
17 99
18 102
19 25
20 108
21 219
22 26
23 111
24 8
25 19
26 22
27 5
28 60
29 123
30 14
31 63
32 96
33 195
34 198
35 49
36 204
37 411
38 50
39 207
40 216
41 435
42 438
43 109
44 52
45 107
46 222
47 55
48 16
49 35
50 38
51 9
52 44
53 91
54 10
55 47
56 120
57 243
58 246
59 61
60 28
61 59
62 126
63 31

List of values

[0, 3, 6, 1, 12, 27, 2, 15, 24, 51, 54, 13, 4, 11, 30, 7, 48, 99, 102, 25, 108, 219, 26, 111, 8, 19, 22, 5, 60, 123, 14, 63, 96, 195, 198, 49, 204, 411, 50, 207, 216, 435, 438, 109, 52, 107, 222, 55, 16, 35, 38, 9, 44, 91, 10, 47, 120, 243, 246, 61, 28, 59, 126, 31]