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.

A163382 a(n) = the (decimal equivalent of the) smallest integer that can be made by rotating the binary digits of n any number of positions to the left or right, where a(n) in binary must contain the same number of digits (without any leading 0's) as n written in binary.

Table of values

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

List of values

[1, 2, 3, 4, 5, 5, 7, 8, 9, 10, 11, 9, 11, 11, 15, 16, 17, 18, 19, 18, 21, 21, 23, 17, 19, 21, 23, 19, 23, 23, 31, 32, 33, 34, 35, 36, 37, 38, 39, 34, 38, 42, 43, 37, 45, 43, 47, 33, 35, 37, 39, 38, 43, 45, 47, 35, 39, 43, 47, 39, 47, 47, 63, 64, 65, 66, 67, 68, 69, 70, 71, 68, 73]