What is the rule exactly?

Start with any positive integer n. If n is even, the next term is n / 2; if n is odd, the next term is 3n + 1. Repeat until you reach 1. The number of steps to reach 1 is called the total stopping time.

Does every number reach 1?

It is conjectured — and verified for every number ever tested by computers — but never proven in general. That open question is the Collatz conjecture.

Why does 27 take so long?

Although 27 is small, its sequence climbs to a peak of 9232 and takes 111 steps before falling to 1, which makes it a popular example of how unpredictable the path can be.

Collatz Conjecture (3n+1) Sequence

Everyday

The Collatz conjecture, also called the 3n+1 problem or the hailstone sequence, applies a simple rule to a positive integer: if it is even, divide by two; if it is odd, multiply by three and add one. Repeat and, as far as anyone has tested, you always reach 1. Enter a starting number and this tool lists the entire sequence, counts the steps (the stopping time), and reports the highest value reached along the way. Arbitrarily large numbers are handled exactly with big integers. Everything is computed locally in your browser.

—

Starting number

Steps to 1111

Peak value9232

Terms112

Sequence

27, 82, 41, 124, 62, 31, 94, 47, 142, 71, 214, 107, 322, 161, 484, 242, 121, 364, 182, 91, 274, 137, 412, 206, 103, 310, 155, 466, 233, 700, 350, 175, 526, 263, 790, 395, 1186, 593, 1780, 890, 445, 1336, 668, 334, 167, 502, 251, 754, 377, 1132, 566, 283, 850, 425, 1276, 638, 319, 958, 479, 1438, 719, 2158, 1079, 3238, 1619, 4858, 2429, 7288, 3644, 1822, 911, 2734, 1367, 4102, 2051, 6154, 3077, 9232, 4616, 2308, 1154, 577, 1732, 866, 433, 1300, 650, 325, 976, 488, 244, 122, 61, 184, 92, 46, 23, 70, 35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1

How to use

Enter a positive whole number.
Read the number of steps, the peak value and the sequence length.
Scroll the full sequence and copy it with one click.
Try famous starters like 27 (111 steps, peak 9232) to see how wildly the path can swing.

Frequently asked questions

What is the rule exactly?: Start with any positive integer n. If n is even, the next term is n / 2; if n is odd, the next term is 3n + 1. Repeat until you reach 1. The number of steps to reach 1 is called the total stopping time.
Does every number reach 1?: It is conjectured — and verified for every number ever tested by computers — but never proven in general. That open question is the Collatz conjecture.
Why does 27 take so long?: Although 27 is small, its sequence climbs to a peak of 9232 and takes 111 steps before falling to 1, which makes it a popular example of how unpredictable the path can be.

Related tools

Tile Calculator

Work out how many floor or wall tiles you need for a room — from its length and width and the tile size, with an adjustable waste allowance and boxes required.

Everyday00

Compound Interest Calculator

Project how a starting balance grows with regular contributions, your interest rate, and your compounding frequency.

Everyday00

Age Calculator

Calculate exact age in years, months, days — and find your next birthday.

Everyday00

BMI Calculator

Calculate Body Mass Index from height and weight, with a healthy range.

Everyday00

Tip Calculator

Calculate the tip and split the total bill between people.

Everyday00

Percentage Calculator

Work out percentages, what-percent, and percent change in one place.

Everyday00