A060410 - cp's OEIS frontend

A060410 In the '3x+1' problem, take the sequence of starting values which set new records for the highest point of the trajectory before reaching 1 (A006884); sequence gives associated maximal value reached in the trajectory with that start.

n	a(n)
1	2
2	8
3	26
4	80
5	4616
6	6560
7	19682
8	20762
9	125252
10	638468
11	3405068
12	4076810
13	13557212
14	25071632
15	53179010
16	60506432
17	296639576
18	785412368
19	1241055674
20	1399161680
21	8601188876
22	12324038948
23	26241642656
24	28495741760

[2, 8, 26, 80, 4616, 6560, 19682, 20762, 125252, 638468, 3405068, 4076810, 13557212, 25071632, 53179010, 60506432, 296639576, 785412368, 1241055674, 1399161680, 8601188876, 12324038948, 26241642656, 28495741760]

cp's OEIS Frontend

A060410 In the '3x+1' problem, take the sequence of starting values which set new records for the highest point of the trajectory before reaching 1 (A006884); sequence gives associated maximal value reached in the trajectory with that start.

Table of values

List of values