navbar-top.gif
btn_spacer.gifHomeTopicsLatestRandomAboutFAQsParticipateAuthoring Areabtn_spacer.gif

3n+1 Graph

The process constructs a sequence starting with and iterating this process: if is even, compute , and if is odd, compute .
Connect two successive numbers in such a sequence by an arrow to get a graph. Take all the sequences up to a maximum starting number to get the bigger graph shown here. A pair of numbers may be joined by several edges because the sequences from different starting numbers can overlap.
Powered by Wolfram Mathematica
Contact The Wolfram Demonstrations Project Team    Site Index    Wolfram Research
©  2008 The Wolfram Demonstrations Project & Contributors    Terms of Use    Privacy Policy    RSS    Atom