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.

A066057 'Reverse and Add' carried out in base 2 (cf. A062128); number of steps needed to reach a palindrome, or -1 if no palindrome is ever reached.

Table of values

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

List of values

[0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 1, 2, 1, 0, 1, 0, 1, 4, 5, 0, -1, 2, 1, 4, -1, 0, -1, 2, 1, 0, 1, 0, 1, -1, 1, -1, 1, 2, 1, -1, 1, 2, 3, 0, -1, -1, 1, -1, 3, 0, 1, 2, 3, 2, 1, 2, 3, 2, -1, -1, 1, 0, 1, 0, 1, -1, 1, 2, 1, 4, 3, 0, 11, -1, 5, -1, -1, 2, 1, 2, 1, 4, -1, 0, -1, 2, 5, -1, -1, 2, 3, 0, -1, -1, 1, -1, 3, 0, 1, 4, 1, 10, 11, -1, -1, 0, -1, 2, -1, 4]