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.

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

Table of values

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

List of values

[0, 1, 1, 3, 1, 3, 3, 7, 1, 3, 3, 7, 5, 7, 7, 15, 1, 3, 3, 7, 5, 7, 7, 15, 9, 11, 11, 15, 13, 15, 15, 31, 1, 3, 3, 7, 5, 7, 7, 15, 9, 11, 11, 15, 13, 15, 15, 31, 17, 19, 19, 23, 21, 23, 23, 31, 25, 27, 27, 31, 29, 31, 31, 63, 1, 3, 3, 7, 5, 7, 7, 15, 9, 11, 11]

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

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