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.

A118514 Define sequence S_n by: initial term = n, reverse digits and add 2 to get next term. It is conjectured that S_n always reaches a cycle. Sequence gives number of steps for S_n to reach a cycle.

Table of values

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

List of values

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