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.

A246592 Smallest number that can be obtained by swapping 2 adjacent bits in the binary expansion of n.

Table of values

n a(n)
0 0
1 1
2 1
3 3
4 2
5 3
6 5
7 7
8 4
9 5
10 6
11 7
12 10
13 11
14 13
15 15
16 8
17 9
18 10
19 11
20 12
21 13
22 14
23 15
24 20
25 21
26 22
27 23
28 26
29 27
30 29
31 31
32 16
33 17
34 18
35 19
36 20
37 21
38 22
39 23
40 24
41 25
42 26
43 27
44 28
45 29
46 30
47 31
48 40
49 41
50 42
51 43
52 44
53 45
54 46
55 47
56 52
57 53
58 54
59 55
60 58
61 59
62 61
63 63
64 32
65 33
66 34
67 35
68 36

List of values

[0, 1, 1, 3, 2, 3, 5, 7, 4, 5, 6, 7, 10, 11, 13, 15, 8, 9, 10, 11, 12, 13, 14, 15, 20, 21, 22, 23, 26, 27, 29, 31, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 40, 41, 42, 43, 44, 45, 46, 47, 52, 53, 54, 55, 58, 59, 61, 63, 32, 33, 34, 35, 36]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.