A276665 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

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

LINKS

Table of n, a(n) for n=1..7.

José Eduardo Gaboardi de Carvalho, Java program

CROSSREFS

Intersection of A006877 and A006884.

Sequence in context: A137075 A270347 A060412 * A062573 A019435 A061092

Adjacent sequences: A276662 A276663 A276664 * A276666 A276667 A276668

KEYWORD

nonn,more

AUTHOR

José Eduardo Gaboardi de Carvalho, Sep 12 2016

STATUS

approved