WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

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.
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.