login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A280341 Number of unique heights achieved in the Collatz (or '3x+1') problem when starting from numbers in the range [2^n,2^(n+1)). 0
1, 2, 4, 6, 10, 16, 26, 41, 53, 64, 74, 85, 101, 118, 128, 144, 157, 174, 195, 217, 238, 261, 281, 309, 324 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Here the height is defined to be the number of halving and tripling steps required to reach 1.

Interestingly the values in this sequence grow slowly (almost linearly) indicating that the average number of starting values with the same height increases with n.

Question: Is this sequence always increasing?

LINKS

Table of n, a(n) for n=0..24.

EXAMPLE

The heights for starting values 16 to 31 are: 4, 12, 20, 20, 7, 7, 15, 15, 10, 23, 10, 111, 18, 18, 18, 106. The unique heights are: 4, 12, 20, 7, 15, 10, 23, 111, 18, 106. Hence a(4)=10.

CROSSREFS

Cf. A006577, A277109.

Sequence in context: A017985 A327474 A028488 * A227572 A080432 A094985

Adjacent sequences:  A280338 A280339 A280340 * A280342 A280343 A280344

KEYWORD

nonn

AUTHOR

Dmitry Kamenetsky, Jan 01 2017

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 12 22:16 EST 2019. Contains 329079 sequences. (Running on oeis4.)