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.

A225416 Number of iterations of the map n -> f(n) needed to reach 0 and starting with n, where f(n) is given by the following definition: f(n) = u(n) mod v(n) where u(n) = max (n, reverse(n)) and v(n) = min(n, reverse(n)).

Table of values

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

List of values

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