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.

A063251 Least number of binary rotations needed to reach fixed point (with either left or right rotation allowed at each iteration).

Table of values

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

List of values

[0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 2, 2, 1, 0, 1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 3, 2, 2, 2, 1, 0, 1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 3, 2, 3, 3, 2, 1, 2, 2, 3, 2, 3, 3, 3, 2, 3, 3, 3, 3, 2, 2, 1, 0, 1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 3, 2, 3, 3, 2, 1, 2, 2, 3, 2, 3, 3, 3, 2, 3, 3, 4, 3, 3, 4, 2, 1, 2, 2, 3, 2, 3, 3, 3, 2, 3]