A277365 - cp's OEIS frontend

A277365 a(n) is the smallest number k such that f(k) = f(n) + f(n+1) and g(k) = g(n) + g(n+1), where f(n) (resp. g(n)) is the number of halving (resp. tripling) steps to reach 1 in the Collatz ('3x+1') problem.

n	a(n)
1	2
2	6
3	12
4	20
5	34
6	49
7	56
8	72
9	98
10	112
11	144
12	176
13	196
14	228
15	224
16	272
17	344
18	406
19	392
20	384
21	448
22	520
23	576
24	688
25	688
26	772
27	913
28	912
29	912
30	1028
31	992
32	1040
33	1220
34	1152
35	1376
36	1624
37	1624
38	1708
39	1624
40	1728
41	1728
42	1824
43	2160
44	2080
45	2080
46	2215
47	2559
48	2752
49	2884
50	2884
51	2752

[2, 6, 12, 20, 34, 49, 56, 72, 98, 112, 144, 176, 196, 228, 224, 272, 344, 406, 392, 384, 448, 520, 576, 688, 688, 772, 913, 912, 912, 1028, 992, 1040, 1220, 1152, 1376, 1624, 1624, 1708, 1624, 1728, 1728, 1824, 2160, 2080, 2080, 2215, 2559, 2752, 2884, 2884, 2752]

cp's OEIS Frontend

A277365 a(n) is the smallest number k such that f(k) = f(n) + f(n+1) and g(k) = g(n) + g(n+1), where f(n) (resp. g(n)) is the number of halving (resp. tripling) steps to reach 1 in the Collatz ('3x+1') problem.

Table of values

List of values