A375280 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A375280

Largest value in the trajectory of n in the A375265 map.

1, 2, 3, 4, 16, 6, 52, 8, 9, 16, 52, 12, 40, 52, 16, 16, 52, 18, 88, 20, 52, 52, 160, 24, 88, 40, 27, 52, 88, 30, 9232, 32, 52, 52, 160, 36, 112, 88, 40, 40, 9232, 52, 196, 52, 45, 160, 9232, 48, 148, 88, 52, 52, 160, 54, 9232, 56, 88, 88, 304, 60, 184, 9232, 63

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

OFFSET

1,2

COMMENTS

By definition the trajectory ends when 1 is reached, so a(1) = 1.

LINKS

Paolo Xausa, Table of n, a(n) for n = 1..10000

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

FORMULA

a(n) = max{A375266(n,k) for 1 <= k <= A375267(n) + 1}.

EXAMPLE

a(10) = 16 because 16 is the largest value in the trajectory 10 -> 5 -> 16 -> 8 -> 4 -> 2 -> 1.