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.

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

List of values

[0, 0, 0, 1, 0, 2, 1, 2, 0, 1, 0, 2, 1, 0, 2, 3, 0, 4, 1, 2, 0, 1, 2, 0, 3, 4, 0, 1, 0, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 0, 2, 3, 3, 2, 1, 1, 2, 3, 3, 2, 3, 0, 18, 1, 2, 0, 1, 2, 4, 1, 2, 2, 1, 2, 4, 1, 2, 0, 3, 2, 4, 1, 2, 2, 3, 2, 4, 17, 18, 0, 1, 0, 2, 1, 1, 2, 1, 1, 3, 1, 0, 2, 1, 1, 16, 1, 1, 2, 2, 0, 2, 4, -1, 16, 3, 15, 2, 1, 1, 2, 1, 0, 3, 3, 3, 2, 1, 1, 16, 1]