A087262 - 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

A087262

Integer quotient of largest and initial values in 3x+1 iteration, started at n.

1, 1, 5, 1, 3, 2, 7, 1, 5, 1, 4, 1, 3, 3, 10, 1, 3, 2, 4, 1, 3, 2, 6, 1, 3, 1, 341, 1, 3, 5, 297, 1, 3, 1, 4, 1, 3, 2, 7, 1, 225, 1, 4, 1, 3, 3, 196, 1, 3, 1, 4, 1, 3, 170, 167, 1, 3, 1, 5, 2, 3, 148, 146, 1, 3, 1, 4, 1, 3, 2, 130, 1, 126, 1, 4, 1, 3, 3, 10, 1, 3, 112, 111, 1, 3, 2, 6, 1, 3, 1, 101

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

OFFSET

1,3

COMMENTS

Remarkably often, several consecutive terms are identical or close, showing closeness of peaks too: at n=107-111, a(n)=83-86.

If a(n)=1, then the peak is the start-value (per A166245).

It is conjectured that if peak/initial value is an integer then it equals 1.

LINKS

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

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

FORMULA

a(n) = floor(A025586(n)/n).