A365478 - cp's OEIS frontend

A365478 In the Collatz problem, largest value in the trajectory of n in the 3x+1 function (denoted by T(x) in the literature, and defined as T(x) = (3x+1)/2 if x is odd, T(x) = x/2 if x is even), or -1 if the trajectory is divergent.

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

[1, 2, 8, 4, 8, 8, 26, 8, 26, 10, 26, 12, 20, 26, 80, 16, 26, 26, 44, 20, 32, 26, 80, 24, 44, 26, 4616, 28, 44, 80, 4616, 32, 50, 34, 80, 36, 56, 44, 152, 40, 4616, 42, 98, 44, 68, 80, 4616, 48, 74, 50, 116, 52, 80, 4616, 4616, 56, 98, 58, 152, 80, 92, 4616, 4616]

cp's OEIS Frontend

A365478 In the Collatz problem, largest value in the trajectory of n in the 3x+1 function (denoted by T(x) in the literature, and defined as T(x) = (3x+1)/2 if x is odd, T(x) = x/2 if x is even), or -1 if the trajectory is divergent.

Table of values

List of values