A143812

Maximal number of halving and tripling steps to reach 1 in '3x+1' problem for range (1, ..., n).

1, 2, 8, 8, 8, 9, 17, 17, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 24, 24, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 113, 113, 113, 113, 113

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

OFFSET

LINKS

MATHEMATICA

CROSSREFS

KEYWORD

AUTHOR

EXTENSIONS

STATUS