A060415 - cp's OEIS frontend

A060415 In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated iterate where maximal value is reached in the trajectory with that start.

n	a(n)
1	0
2	2
3	3
4	45
5	48
6	20
7	78
8	124
9	95
10	103
11	62
12	147
13	186
14	36
15	168
16	65
17	60
18	179
19	41
20	146
21	254
22	254
23	319
24	346
25	423
26	166
27	297
28	206
29	223
30	164
31	659
32	607
33	840
34	808
35	512

[0, 2, 3, 45, 48, 20, 78, 124, 95, 103, 62, 147, 186, 36, 168, 65, 60, 179, 41, 146, 254, 254, 319, 346, 423, 166, 297, 206, 223, 164, 659, 607, 840, 808, 512]

cp's OEIS Frontend

A060415 In the '3x+1' problem, take the sequence of starting values which set new records for the "dropping time" (A060412); sequence gives associated iterate where maximal value is reached in the trajectory with that start.

Table of values

List of values

n	a(n)
1	0
2	2
3	3
4	45
5	48
6	20
7	78
8	124
9	95
10	103
11	62
12	147
13	186
14	36
15	168
16	65
17	60
18	179
19	41
20	146
21	254
22	254
23	319
24	346
25	423
26	166
27	297
28	206
29	223
30	164
31	659
32	607
33	840
34	808
35	512

n	a(n)
1	0
2	2
3	3
4	45
5	48
6	20
7	78
8	124
9	95
10	103
11	62
12	147
13	186
14	36
15	168
16	65
17	60
18	179
19	41
20	146
21	254
22	254
23	319
24	346
25	423
26	166
27	297
28	206
29	223
30	164
31	659
32	607
33	840
34	808
35	512

n	a(n)
1	0
2	2
3	3
4	45
5	48
6	20
7	78
8	124
9	95
10	103
11	62
12	147
13	186
14	36
15	168
16	65
17	60
18	179
19	41
20	146
21	254
22	254
23	319
24	346
25	423
26	166
27	297
28	206
29	223
30	164
31	659
32	607
33	840
34	808
35	512