3n+1 Graph

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

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.


Contributed by: Jacqueline Zizi (March 2011)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.