A276665 In the '3x+1' problem, these values for the starting value set new records for both the number of steps and the highest point of trajectory before reaching 1.

1, 2, 3, 7, 27, 703, 26623

Offset: 1

Author

José Eduardo Gaboardi de Carvalho, Sep 12 2016

Keywords

• nonn
• more

Comments

Both the 3x+1 steps and the halving steps are counted.

If it exists, a(7) > 14727207461063895711 (A006877(148)). - Hugo Pfoertner, Jan 12 2025

Links

• José Eduardo Gaboardi de Carvalho, Java program

Crossrefs

Intersection of A006877 and A006884.