Collatz research MOVED

THIS POST MOVED TO MY NEW BLOG AT

https://blog.phor.net/looking-into-collatz 

Comments

Anonymous said…
if n is a power of 2, then f(n) = n, making a nice binary tree pattern.

if n mod 4 = 0, then f(n) mod 4 = 0.

the number of imbedded binary trees increases for each leaf by twofold.

somehow 3^n is involved, powers of three are rampant, more so for the even elements.

because of the collatz relationship, f(2x), f(2x-1) is probably the layout.

Dont leave me hanging, explain math ASAP, ima PTFO after looking at this shit so long.
-D
I got on the integer sequences with this: http://oeis.org/A119733

Popular posts from this blog

Interesting properties of the entropy function

Nontechnical: What is ERC-721?

I Was Kidnapped in Manila and Lived to Tell About it