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.

A118511 Define sequence S_n by: initial term = n, reverse digits and add 1 to get next term. It is conjectured that S_n always reaches a cycle of length 9, as in A117230. Sequence gives number of steps for S_n to reach the cycle.

Table of values

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

List of values

[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 17, 15, 13, 11, 9, 7, 5, 3, 1, 16, 16, 15, 13, 11, 9, 7, 5, 3, 1, 14, 14, 14, 13, 11, 9, 7, 5, 3, 1, 12, 12, 12, 12, 11, 9, 7, 5, 3, 1, 10, 10, 10, 10, 10, 9, 7, 5, 3, 1, 8, 8, 8, 8, 8, 8, 7, 5, 3, 1, 6, 6, 6, 6, 6, 6, 6, 5, 3, 1, 4, 4, 4, 4, 4, 4, 4]