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.

A030547 Number of terms (including the initial term) needed to reach a palindrome when the Reverse Then Add! map (x -> x + (x-with-digits-reversed)) is repeatedly applied to n, or -1 if a palindrome is never reached.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 1, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 1, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 1, 2, 3, 2, 3, 3, 2, 2, 2, 2, 2, 1, 2, 3, 3, 4, 2, 2, 2, 2, 3, 2, 1, 3, 4, 5, 2, 2, 2, 3, 2, 3, 3, 1, 5, 7, 2, 2, 3, 2, 3, 3, 4, 5, 1, 25, 2, 3, 2, 3, 3, 4, 5, 7, 25]