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.

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

List of values

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