The Collatz Problem, help writing a program for this?

Here is the collatz problem:

X_k+1             x_k/2 if x_k is even
          {                                        for k = 0,1,2...
                  3_xk+1 if x_k is odd

I am looking for some positive integer x_0 as a starting value where the sequence should terminate when x_n = 1. I Want my program to run with x_0 = m for each integer m from 1 through 3000. I want to make a graph of these values on my x - axis, and the number of steps the sequence takes to terminate when starting from x_0 = m on the y-axis. Then with x_0 for the largest number of steps, make a graph with the values of k on the x-axis and values of x_k on the y-axis.

It is mainly the code I need help with, writing the program. I found this exercise from a student who said it would help me but I just can't figure out how to go about doing it. I would greatly appreciate some good help.

Answer 1

[Sean de Wolski]

docsearch collatz

Might be a good place to start