A348006 - cp's OEIS frontend

A348006 Largest increment in the trajectory from n to 1 in the Collatz map (or 3x+1 problem), or -1 if no such trajectory exists.

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

[0, 0, 11, 0, 11, 11, 35, 0, 35, 11, 35, 11, 27, 35, 107, 0, 35, 35, 59, 11, 43, 35, 107, 11, 59, 27, 6155, 35, 59, 107, 6155, 0, 67, 35, 107, 35, 75, 59, 203, 11, 6155, 43, 131, 35, 91, 107, 6155, 11, 99, 59, 155, 27, 107, 6155, 6155, 35, 131, 59, 203, 107]

cp's OEIS Frontend

A348006 Largest increment in the trajectory from n to 1 in the Collatz map (or 3x+1 problem), or -1 if no such trajectory exists.

Table of values

List of values