A143812 - cp's OEIS frontend

A143812 Maximal number of halving and tripling steps to reach 1 in '3x+1' problem for range (1, ..., n).

n	a(n)
1	1
2	2
3	8
4	8
5	8
6	9
7	17
8	17
9	20
10	20
11	20
12	20
13	20
14	20
15	20
16	20
17	20
18	21
19	21
20	21
21	21
22	21
23	21
24	21
25	24
26	24
27	112
28	112
29	112
30	112
31	112
32	112
33	112
34	112
35	112
36	112
37	112
38	112
39	112
40	112
41	112
42	112
43	112
44	112
45	112
46	112
47	112
48	112
49	112
50	112
51	112
52	112
53	112
54	113
55	113
56	113
57	113
58	113

[1, 2, 8, 8, 8, 9, 17, 17, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 24, 24, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 113, 113, 113, 113, 113]

cp's OEIS Frontend

A143812 Maximal number of halving and tripling steps to reach 1 in '3x+1' problem for range (1, ..., n).

Table of values

List of values

n	a(n)
1	1
2	2
3	8
4	8
5	8
6	9
7	17
8	17
9	20
10	20
11	20
12	20
13	20
14	20
15	20
16	20
17	20
18	21
19	21
20	21
21	21
22	21
23	21
24	21
25	24
26	24
27	112
28	112
29	112
30	112
31	112
32	112
33	112
34	112
35	112
36	112
37	112
38	112
39	112
40	112
41	112
42	112
43	112
44	112
45	112
46	112
47	112
48	112
49	112
50	112
51	112
52	112
53	112
54	113
55	113
56	113
57	113
58	113

n	a(n)
1	1
2	2
3	8
4	8
5	8
6	9
7	17
8	17
9	20
10	20
11	20
12	20
13	20
14	20
15	20
16	20
17	20
18	21
19	21
20	21
21	21
22	21
23	21
24	21
25	24
26	24
27	112
28	112
29	112
30	112
31	112
32	112
33	112
34	112
35	112
36	112
37	112
38	112
39	112
40	112
41	112
42	112
43	112
44	112
45	112
46	112
47	112
48	112
49	112
50	112
51	112
52	112
53	112
54	113
55	113
56	113
57	113
58	113

n	a(n)
1	1
2	2
3	8
4	8
5	8
6	9
7	17
8	17
9	20
10	20
11	20
12	20
13	20
14	20
15	20
16	20
17	20
18	21
19	21
20	21
21	21
22	21
23	21
24	21
25	24
26	24
27	112
28	112
29	112
30	112
31	112
32	112
33	112
34	112
35	112
36	112
37	112
38	112
39	112
40	112
41	112
42	112
43	112
44	112
45	112
46	112
47	112
48	112
49	112
50	112
51	112
52	112
53	112
54	113
55	113
56	113
57	113
58	113