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.

A331857 a(n) is the greatest value obtained by partitioning the binary representation of n into consecutive blocks, and then reversing those blocks.

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 12
10 12
11 14
12 12
13 14
14 14
15 15
16 16
17 24
18 24
19 28
20 24
21 26
22 28
23 30
24 24
25 28
26 28
27 30
28 28
29 30
30 30
31 31
32 32
33 48
34 48
35 56
36 48
37 52
38 56
39 60
40 48
41 52
42 52
43 58
44 56
45 58
46 60
47 62
48 48
49 56
50 56
51 60
52 56
53 58
54 60
55 62
56 56
57 60
58 60
59 62
60 60
61 62
62 62
63 63
64 64
65 96
66 96

List of values

[0, 1, 2, 3, 4, 6, 6, 7, 8, 12, 12, 14, 12, 14, 14, 15, 16, 24, 24, 28, 24, 26, 28, 30, 24, 28, 28, 30, 28, 30, 30, 31, 32, 48, 48, 56, 48, 52, 56, 60, 48, 52, 52, 58, 56, 58, 60, 62, 48, 56, 56, 60, 56, 58, 60, 62, 56, 60, 60, 62, 60, 62, 62, 63, 64, 96, 96]

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

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