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.

A118522 Define sequence S_n by: initial term = n, reverse digits and add 3 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 3
4 0
5 2
6 2
7 0
8 1
9 1
10 0
11 0
12 0
13 6
14 0
15 0
16 0
17 4
18 0
19 0
20 3
21 0
22 0
23 14
24 0
25 0
26 0
27 4
28 0
29 0
30 3
31 0
32 0
33 11
34 5
35 13
36 10
37 3
38 6
39 6
40 1
41 5
42 5
43 4
44 0
45 0
46 4
47 0
48 0
49 0
50 2
51 0
52 0
53 7
54 0
55 0
56 12
57 0
58 0
59 0
60 2
61 0
62 0
63 7
64 0
65 0
66 9
67 3
68 11
69 8
70 1
71 4
72 4
73 2
74 3
75 3
76 2
77 0
78 0
79 2
80 0
81 0
82 0
83 6
84 0
85 0
86 5
87 0
88 0
89 10
90 0
91 0
92 0
93 6
94 0
95 0

List of values

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