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.

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

Table of values

n a(n)
0 0
1 1
2 4
3 3
4 2
5 9
6 12
7 7
8 16
9 5
10 36
11 19
12 6
13 25
14 28
15 15
16 8
17 33
18 20
19 11
20 18
21 73
22 76
23 39
24 48
25 13
26 100
27 51
28 14
29 57
30 60
31 31
32 64
33 17
34 132
35 67
36 10
37 41
38 44
39 23
40 144
41 37
42 292
43 147
44 38
45 153
46 156
47 79
48 24
49 97
50 52
51 27
52 50
53 201
54 204
55 103
56 112
57 29
58 228
59 115
60 30
61 121
62 124
63 63
64 32

List of values

[0, 1, 4, 3, 2, 9, 12, 7, 16, 5, 36, 19, 6, 25, 28, 15, 8, 33, 20, 11, 18, 73, 76, 39, 48, 13, 100, 51, 14, 57, 60, 31, 64, 17, 132, 67, 10, 41, 44, 23, 144, 37, 292, 147, 38, 153, 156, 79, 24, 97, 52, 27, 50, 201, 204, 103, 112, 29, 228, 115, 30, 121, 124, 63, 32]