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.

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

Offset

1,1

Links

David Barina, Table of n, a(n) for n = 1..93 (first 88 terms from the web page of Tomás Oliveira e Silva)

David Barina, Path records.

Tomás Oliveira e Silva, Tables (gives many more terms)

Index entries for sequences related to 3x+1 (or Collatz) problem

Formula

a(n) = A006885(n+1) / 2 for n > 1. - V. Barbera, Apr 13 2026

Crossrefs

Cf. A006884, A006885, A060409, A060411.

Sequence in context: A295137 A126966 A002930 * A128634 A230904 A289595

Adjacent sequences: A060407 A060408 A060409 * A060411 A060412 A060413

Keyword

nonn

Author

N. J. A. Sloane, Apr 06 2001

Status

approved