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.

A033665 Number of 'Reverse and Add' steps needed to reach a palindrome starting at n, or -1 if n never reaches a palindrome.

Table of values

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

List of values

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