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.

A257697 a(n)=0 for n <= 1; for n >= 2, a(n) = largest number that can be obtained by rotating non-msb bits of binary expansion of n (with A080541 or A080542), without the most significant bit of n: a(n) = A053645(A256999(n)).

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 0
5 2
6 2
7 3
8 0
9 4
10 4
11 6
12 4
13 6
14 6
15 7
16 0
17 8
18 8
19 12
20 8
21 10
22 12
23 14
24 8
25 12
26 10
27 14
28 12
29 14
30 14
31 15
32 0
33 16
34 16
35 24
36 16
37 20
38 24
39 28
40 16
41 20
42 20
43 26
44 24
45 26
46 28
47 30
48 16
49 24
50 20
51 28
52 20
53 26
54 26
55 30
56 24
57 28
58 26
59 30
60 28
61 30
62 30
63 31
64 0
65 32
66 32
67 48
68 32
69 40
70 48
71 56
72 32
73 36
74 40
75 50
76 48
77 52
78 56
79 60
80 32
81 40
82 36
83 52
84 40
85 42
86 50
87 58
88 48
89 50
90 52
91 54
92 56
93 58
94 60

List of values

[0, 0, 0, 1, 0, 2, 2, 3, 0, 4, 4, 6, 4, 6, 6, 7, 0, 8, 8, 12, 8, 10, 12, 14, 8, 12, 10, 14, 12, 14, 14, 15, 0, 16, 16, 24, 16, 20, 24, 28, 16, 20, 20, 26, 24, 26, 28, 30, 16, 24, 20, 28, 20, 26, 26, 30, 24, 28, 26, 30, 28, 30, 30, 31, 0, 32, 32, 48, 32, 40, 48, 56, 32, 36, 40, 50, 48, 52, 56, 60, 32, 40, 36, 52, 40, 42, 50, 58, 48, 50, 52, 54, 56, 58, 60]