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.

A243112 a(n) is the smallest number that requires at least n adjacent bit swaps in order to pack all the ones to the right.

Table of values

n a(n)
0 0
1 2
2 4
3 8
4 12
5 20
6 24
7 40
8 48
9 56
10 88
11 104
12 112
13 176
14 208
15 224
16 240
17 368
18 432
19 464
20 480
21 736
22 864
23 928
24 960
25 992
26 1504
27 1760
28 1888
29 1952
30 1984
31 3008
32 3520
33 3776
34 3904
35 3968
36 4032
37 6080
38 7104
39 7616
40 7872
41 8000
42 8064
43 12160
44 14208
45 15232
46 15744
47 16000
48 16128

List of values

[0, 2, 4, 8, 12, 20, 24, 40, 48, 56, 88, 104, 112, 176, 208, 224, 240, 368, 432, 464, 480, 736, 864, 928, 960, 992, 1504, 1760, 1888, 1952, 1984, 3008, 3520, 3776, 3904, 3968, 4032, 6080, 7104, 7616, 7872, 8000, 8064, 12160, 14208, 15232, 15744, 16000, 16128]