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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176869 Numbers that are the maximum value attained by the Collatz (3x+1) iteration of some odd number. 3


%S 1,16,40,52,64,88,100,112,136,148,160,184,196,208,232,244,256,280,304,

%T 340,352,400,424,448,472,520,532,544,592,616,628,640,688,712,724,736,

%U 784,808,820,832,868,904,916,928,952,964,976,1024,1048,1072,1108,1120

%N Numbers that are the maximum value attained by the Collatz (3x+1) iteration of some odd number.

%C Here the 3x+1 steps and the halving steps are applied separately. We use odd numbers because then the Collatz iteration always increases to a maximum value before (hopefully) going to 1. This is a subsequence of A033496. Except for the first term, all these numbers appear to equal 4 (mod 12). Some terms are the maximum value for the Collatz iteration of many numbers. For example, 9232 is the maximum value of the Collatz iteration of 408 odd numbers, the smallest of which is 27.

%H T. D. Noe, <a href="/A176869/b176869.txt">Table of n, a(n) for n=1..1000</a>

%Y Cf. A025586 (maximum value in the Collatz iteration of n)

%K nonn

%O 1,2

%A _T. D. Noe_, Apr 27 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 17:25 EST 2022. Contains 358668 sequences. (Running on oeis4.)