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.

A246594 a(n)=n for n <= 2; for n >= 3, a(n) = largest number that can be obtained by swapping two adjacent bits in the binary expansion of n.

Table of values

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

List of values

[0, 1, 2, 3, 4, 6, 6, 7, 8, 10, 12, 13, 12, 14, 14, 15, 16, 18, 20, 21, 24, 25, 26, 27, 24, 26, 28, 29, 28, 30, 30, 31, 32, 34, 36, 37, 40, 41, 42, 43, 48, 49, 50, 51, 52, 53, 54, 55, 48, 50, 52, 53, 56, 57, 58, 59, 56, 58, 60, 61, 60, 62, 62, 63, 64, 66, 68]