A290101 - cp's OEIS frontend

A290101 a(n) = dropping time for the modified Collatz problem, where x -> 3x+1 if x is odd, and x -> either x/2 or 3x+1 if x is even (minimal number of any such steps to reach a lower number than the starting value n); a(1) = 0 by convention.

n	a(n)
1	0
2	1
3	6
4	1
5	3
6	1
7	11
8	1
9	3
10	1
11	8
12	1
13	3
14	1
15	11
16	1
17	3
18	1
19	6
20	1
21	3
22	1
23	8
24	1
25	3
26	1
27	16
28	1
29	3
30	1
31	19
32	1
33	3
34	1
35	6
36	1
37	3
38	1
39	11
40	1
41	3
42	1
43	8
44	1
45	3
46	1
47	16
48	1
49	3
50	1
51	6
52	1
53	3
54	1
55	8
56	1
57	3
58	1
59	11
60	1
61	3
62	1
63	19
64	1
65	3
66	1
67	6
68	1
69	3
70	1
71	13
72	1
73	3
74	1
75	8
76	1
77	3
78	1
79	13
80	1
81	3
82	1
83	6
84	1
85	3
86	1
87	8
88	1
89	3
90	1
91	11
92	1
93	3
94	1
95	13
96	1
97	3
98	1
99	6
100	1
101	3
102	1
103	16
104	1
105	3
106	1
107	8
108	1
109	3

[0, 1, 6, 1, 3, 1, 11, 1, 3, 1, 8, 1, 3, 1, 11, 1, 3, 1, 6, 1, 3, 1, 8, 1, 3, 1, 16, 1, 3, 1, 19, 1, 3, 1, 6, 1, 3, 1, 11, 1, 3, 1, 8, 1, 3, 1, 16, 1, 3, 1, 6, 1, 3, 1, 8, 1, 3, 1, 11, 1, 3, 1, 19, 1, 3, 1, 6, 1, 3, 1, 13, 1, 3, 1, 8, 1, 3, 1, 13, 1, 3, 1, 6, 1, 3, 1, 8, 1, 3, 1, 11, 1, 3, 1, 13, 1, 3, 1, 6, 1, 3, 1, 16, 1, 3, 1, 8, 1, 3]

cp's OEIS Frontend

A290101 a(n) = dropping time for the modified Collatz problem, where x -> 3x+1 if x is odd, and x -> either x/2 or 3x+1 if x is even (minimal number of any such steps to reach a lower number than the starting value n); a(1) = 0 by convention.

Table of values

List of values

n	a(n)
1	0
2	1
3	6
4	1
5	3
6	1
7	11
8	1
9	3
10	1
11	8
12	1
13	3
14	1
15	11
16	1
17	3
18	1
19	6
20	1
21	3
22	1
23	8
24	1
25	3
26	1
27	16
28	1
29	3
30	1
31	19
32	1
33	3
34	1
35	6
36	1
37	3
38	1
39	11
40	1
41	3
42	1
43	8
44	1
45	3
46	1
47	16
48	1
49	3
50	1
51	6
52	1
53	3
54	1
55	8
56	1
57	3
58	1
59	11
60	1
61	3
62	1
63	19
64	1
65	3
66	1
67	6
68	1
69	3
70	1
71	13
72	1
73	3
74	1
75	8
76	1
77	3
78	1
79	13
80	1
81	3
82	1
83	6
84	1
85	3
86	1
87	8
88	1
89	3
90	1
91	11
92	1
93	3
94	1
95	13
96	1
97	3
98	1
99	6
100	1
101	3
102	1
103	16
104	1
105	3
106	1
107	8
108	1
109	3

n	a(n)
1	0
2	1
3	6
4	1
5	3
6	1
7	11
8	1
9	3
10	1
11	8
12	1
13	3
14	1
15	11
16	1
17	3
18	1
19	6
20	1
21	3
22	1
23	8
24	1
25	3
26	1
27	16
28	1
29	3
30	1
31	19
32	1
33	3
34	1
35	6
36	1
37	3
38	1
39	11
40	1
41	3
42	1
43	8
44	1
45	3
46	1
47	16
48	1
49	3
50	1
51	6
52	1
53	3
54	1
55	8
56	1
57	3
58	1
59	11
60	1
61	3
62	1
63	19
64	1
65	3
66	1
67	6
68	1
69	3
70	1
71	13
72	1
73	3
74	1
75	8
76	1
77	3
78	1
79	13
80	1
81	3
82	1
83	6
84	1
85	3
86	1
87	8
88	1
89	3
90	1
91	11
92	1
93	3
94	1
95	13
96	1
97	3
98	1
99	6
100	1
101	3
102	1
103	16
104	1
105	3
106	1
107	8
108	1
109	3

n	a(n)
1	0
2	1
3	6
4	1
5	3
6	1
7	11
8	1
9	3
10	1
11	8
12	1
13	3
14	1
15	11
16	1
17	3
18	1
19	6
20	1
21	3
22	1
23	8
24	1
25	3
26	1
27	16
28	1
29	3
30	1
31	19
32	1
33	3
34	1
35	6
36	1
37	3
38	1
39	11
40	1
41	3
42	1
43	8
44	1
45	3
46	1
47	16
48	1
49	3
50	1
51	6
52	1
53	3
54	1
55	8
56	1
57	3
58	1
59	11
60	1
61	3
62	1
63	19
64	1
65	3
66	1
67	6
68	1
69	3
70	1
71	13
72	1
73	3
74	1
75	8
76	1
77	3
78	1
79	13
80	1
81	3
82	1
83	6
84	1
85	3
86	1
87	8
88	1
89	3
90	1
91	11
92	1
93	3
94	1
95	13
96	1
97	3
98	1
99	6
100	1
101	3
102	1
103	16
104	1
105	3
106	1
107	8
108	1
109	3