Collatz research MOVED Get link Facebook X Pinterest Email Other Apps June 14, 2006 THIS POST MOVED TO MY NEW BLOG AThttps://blog.phor.net/looking-into-collatz Get link Facebook X Pinterest Email Other Apps 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 William Entriken said… I got on the integer sequences with this: http://oeis.org/A119733
Interesting properties of the entropy function MOVED December 02, 2009 THIS POST MOVED TO MY NEW BLOG AT https://blog.phor.net/interesting-properties-of-entropy Read more
Nontechnical: What is ERC-721? [MOVED] June 24, 2018 THIS POST MOVED TO MY NEW BLOG AT https://blog.phor.net/nontechnical-what-is-erc-721 Read more
I Was Kidnapped in Manila and Lived to Tell About it [MOVED] August 09, 2017 THIS POST MOVED TO MY NEW BLOG AT https://blog.phor.net/kidnapped-in-manila Read more
Comments
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