Collatz 3n+1 Cobweb

Choose an initial integer n. Both +n and -n can be graphed.
Set orbit>= the number of iterations needed to reach 1. Choosing a number unnecessarily large may slow calculations.
For each iteration, standard(x) uses 3n+1 and reduced(x) uses (3n+1)/2.
See http://en.wikipedia.org/wiki/Collatz_conjecture for a description of the conjecture.