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.

A006577 Number of halving and tripling steps to reach 1 in '3x+1' problem, or -1 if 1 is never reached.

Table of values

n a(n)
1 0
2 1
3 7
4 2
5 5
6 8
7 16
8 3
9 19
10 6
11 14
12 9
13 9
14 17
15 17
16 4
17 12
18 20
19 20
20 7
21 7
22 15
23 15
24 10
25 23
26 10
27 111
28 18
29 18
30 18
31 106
32 5
33 26
34 13
35 13
36 21
37 21
38 21
39 34
40 8
41 109
42 8
43 29
44 16
45 16
46 16
47 104
48 11
49 24
50 24
51 24
52 11
53 11
54 112
55 112
56 19
57 32
58 19
59 32
60 19
61 19
62 107
63 107
64 6
65 27
66 27
67 27
68 14
69 14
70 14
71 102
72 22

List of values

[0, 1, 7, 2, 5, 8, 16, 3, 19, 6, 14, 9, 9, 17, 17, 4, 12, 20, 20, 7, 7, 15, 15, 10, 23, 10, 111, 18, 18, 18, 106, 5, 26, 13, 13, 21, 21, 21, 34, 8, 109, 8, 29, 16, 16, 16, 104, 11, 24, 24, 24, 11, 11, 112, 112, 19, 32, 19, 32, 19, 19, 107, 107, 6, 27, 27, 27, 14, 14, 14, 102, 22]