A033491 - cp's OEIS frontend

A033491 a(n) is the smallest integer that takes n halving and tripling steps to reach 1 in the 3x+1 problem.

n	a(n)
0	1
1	2
2	4
3	8
4	16
5	5
6	10
7	3
8	6
9	12
10	24
11	48
12	17
13	34
14	11
15	22
16	7
17	14
18	28
19	9
20	18
21	36
22	72
23	25
24	49
25	98
26	33
27	65
28	130
29	43
30	86
31	172
32	57
33	114
34	39
35	78
36	153
37	305
38	105
39	203
40	406
41	135
42	270
43	540
44	185
45	361
46	123
47	246
48	481
49	169
50	329
51	641
52	219
53	427
54	159
55	295
56	569
57	1138
58	379
59	758
60	283
61	505

[1, 2, 4, 8, 16, 5, 10, 3, 6, 12, 24, 48, 17, 34, 11, 22, 7, 14, 28, 9, 18, 36, 72, 25, 49, 98, 33, 65, 130, 43, 86, 172, 57, 114, 39, 78, 153, 305, 105, 203, 406, 135, 270, 540, 185, 361, 123, 246, 481, 169, 329, 641, 219, 427, 159, 295, 569, 1138, 379, 758, 283, 505]

cp's OEIS Frontend

A033491 a(n) is the smallest integer that takes n halving and tripling steps to reach 1 in the 3x+1 problem.

Table of values

List of values