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.

A061436 Number of steps for trajectory of n to reach 1 under the map that sends x -> x/3 if x mod 3 = 0, x -> x+3-(x mod 3) if x is not 0 mod 3 (for a 2nd time when n starts at 1).

Table of values

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

List of values

[2, 2, 1, 4, 4, 3, 3, 3, 2, 6, 6, 5, 6, 6, 5, 5, 5, 4, 5, 5, 4, 5, 5, 4, 4, 4, 3, 8, 8, 7, 8, 8, 7, 7, 7, 6, 8, 8, 7, 8, 8, 7, 7, 7, 6, 7, 7, 6, 7, 7, 6, 6, 6, 5, 7, 7, 6, 7, 7, 6, 6, 6, 5, 7, 7, 6, 7, 7, 6, 6, 6, 5, 6, 6, 5, 6, 6, 5, 5, 5, 4, 10, 10, 9, 10, 10, 9, 9, 9, 8, 10, 10, 9, 10, 10, 9, 9, 9, 8, 9, 9]