This site is supported by donations to The OEIS Foundation.

Reduced Collatz function

From OeisWiki
Jump to: navigation, search

The Collatz problem could also be restated as asking whether the iterated reduced Collatz function where with as large as possible, always reaches an even power of 2 (a power of 4), in which case the hailstone height then decreases exponentially down to 1.


Reduced Collatz function
From   To   Power (even) of 2
 
 
*
 
 
 
 
 
 
 
*
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

A075677 Reduced Collatz function R applied to the odd integers: a(n) = R(2n-1), where R(k) = (3k+1)/2^r, with r as large as possible.

{1, 5, 1, 11, 7, 17, 5, 23, 13, 29, 1, 35, 19, 41, 11, 47, 25, 53, 7, 59, 31, 65, 17, 71, 37, 77, 5, 83, 43, 89, 23, 95, 49, 101, 13, 107, 55, 113, 29, 119, 61, 125, 1, 131, 67, ...}