Random sequence generator
Shuffle a range into random order with no repeats. Every number from your lower to upper bound appears exactly once.
Output · 0 numbers
No repeatsA shuffled sequence is a random permutation of a range — every number from the lower to the upper bound, each used exactly once, in random order. Useful for draws, turn orders, and randomized assignments.
- Repeats
- None
- Max size
- 10,000
Related tools
This random sequence generator takes every whole number between two bounds and puts them in a random order, each one exactly once. Set the range to 1 and 30 and you get all 30 numbers, shuffled. That's what you want for a raffle draw order, a turn order, or assigning people to slots without anyone being picked twice. Copy the result as a comma-separated list, or as a CSV with each number's position. The shuffle runs in your browser.
How to use the random sequence generator
- Enter the lower and upper bounds. Both are included, negative numbers work, and if you enter them backwards the tool swaps them.
- The sequence reshuffles whenever you change a bound. Click Shuffle for a new order.
- Click any number to copy just that one.
- Use Copy as list for comma-separated values, or Copy CSV for position and value columns.
Permutations vs random numbers
A random number generator can give you the same value twice. A sequence generator can't, because it shuffles a fixed set and every value appears exactly once. That's the property you need for a draw where nobody should come up twice.
The shuffle is a Fisher-Yates shuffle fed by your browser's crypto.getRandomValues, with rejection sampling so no position is favoured. Every possible ordering of the range is equally likely.
Frequently asked questions
What is a random sequence generator?
A tool that takes a range of numbers and outputs all of them in a random order, each exactly once. It's sometimes called a random permutation generator.
How is this different from a random number generator?
A random number generator can repeat values. A sequence generator shuffles a fixed set, so there are no repeats and every value is included.
What is the Fisher-Yates shuffle?
An algorithm for shuffling a list. This version walks through the positions in order and swaps each one with a randomly chosen position from the part of the list that hasn't been settled yet. With an unbiased random source, every ordering is equally likely.
How large can my sequence be?
Up to 10,000 numbers. If your range is bigger, the sequence stops at the lower bound plus 9,999. The page shows the first 200 numbers, and both copy buttons include the full sequence.
Built and maintained by Bipul Kumar. Found a wrong number or a broken result? Tell me and I'll fix it.