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.

A225538 Let r(n) denote the reverse of n. For every n, consider the sequence n_1 = n + 1 + r(n+1), and for m >= 2, n_m = n_(m-1) + 1 + r(n_(m-1) + 1). a(n) is the least m for which n_m is a palindrome, or 0 if there is no such m.

Table of values

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

List of values

[1, 1, 1, 1, 2, 2, 2, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 2, 2, 4, 1, 1, 1, 1, 2, 1, 2, 2, 4, 7, 1, 1, 1, 2, 1, 2, 2, 4, 7, 10, 1, 1, 2, 1, 2, 2, 4, 7]