3n+1 Graph

maximum starting number

7

label vertices

The

3n+1

process constructs a sequence starting with

n

and iterating this process: if

n

is even, compute

n/2

, and if

n

is odd, compute

3n+1

.

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.

Permanent Citation

Jacqueline Zizi

"3n+1 Graph" from the Wolfram Demonstrations Project http://demonstrations.wolfram.com/3n1Graph/
Published: September 28, 2007