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.

A064844 Number of iterations of x -> x + A064834(x) to reach a palindrome, starting with n (or -1 if no palindrome is ever reached).

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 6, 5, 6, 4, 2, 5, 7, 3, 1, 1, 0, 4, 3, 6, 2, 2, 5, 7, 1, 1, 1, 0, 4, 3, 6, 2, 2, 5, 1, 1, 1, 1, 0, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 0, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 0, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 0, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]