I often have to generate a sequence of square numbers so I created this simple utility that does it for me. It lets you generate however many perfect squares you need, starting from any value or position. It works in the browser and is powered by alien technology from the future.

Square Number Sequence Generator Options

Starting Position or Value
Count and Separator
Output Base

Square Number Sequence Generator Examples (click to try!)

First One Hundred Perfect Squares
In this example, we calculate the first 100 square numbers. The list starts with the 0th position, which is a square number because 0×0=0 and goes to 9801 (which is 99×99). The output squares are separated by a comma and the output base is decimal.
0, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400, 441, 484, 529, 576, 625, 676, 729, 784, 841, 900, 961, 1024, 1089, 1156, 1225, 1296, 1369, 1444, 1521, 1600, 1681, 1764, 1849, 1936, 2025, 2116, 2209, 2304, 2401, 2500, 2601, 2704, 2809, 2916, 3025, 3136, 3249, 3364, 3481, 3600, 3721, 3844, 3969, 4096, 4225, 4356, 4489, 4624, 4761, 4900, 5041, 5184, 5329, 5476, 5625, 5776, 5929, 6084, 6241, 6400, 6561, 6724, 6889, 7056, 7225, 7396, 7569, 7744, 7921, 8100, 8281, 8464, 8649, 8836, 9025, 9216, 9409, 9604, 9801
Start from a Position
Find perfect squares starting from this position.
Generate this many perfect squares.
Separate squares with this character.
Decimal Base
Binary Squares
This example outputs five perfect powers of two in the binary base, starting from one million. The starting value is specified as a decimal number (1000000) and the base change is only performed when the squares are printed. The new line symbol "\n" is used to put each square on a new line.
11110100001001000000
11110100101000010001
11110101000111100100
11110101100110111001
11110110000110010000
Start from a Value
Find perfect squares bigger or equal to this value.
Generate this many perfect squares.
Separate squares with this character.
Binary Base
Perfect Square Base
This example uses a custom output base. The base is set to 25, which is a perfect square (5×5), so in this example, perfect squares are printed in a perfect base. Base 25 uses the digits 0-9 and the first fifteen letters of the alphabet a-o. We generate 10 numbers starting from 12 and use the space character to separate them.
1 4 9 g 10 1b 1o 2e 36 40
Start from a Value
Find perfect squares bigger or equal to this value.
Generate this many perfect squares.
Separate squares with this character.
Custom Base
Specify the custom base here. (Works from 2 to 64.)

How Does This Square Number Sequence Generator Work?

This perfect square list generator works entirely in your browser and is written in JavaScript. It uses a simple for loop to calculate count (specified in options) square numbers. The for loop runs count times. If the squares are generated from a specific starting value, then the loop starts from floor(sqrt(start))+1, which is stored in the currentIndex variable. The start value specifies the first perfect square of the output array sqOut. If the squares are generated from a starting index, then the currentIndex variable is assigned the given start value. In every iteration, it calculates currentIndex*currentIndex, converts it to the specified output base, and pushes this value to the sqOut array. When the for loop terminates, all values are joined together through the output delimiter and are printed to the screen via print(sqOut.join(delim)) code snippet. The output delimiter and the output base can also be changed in the options.

Created by Browserling

This square number sequence generator was created by me and my team at Browserling. Behind the scenes, it's actually powered by our programmer tools that are used by millions of people every month. Browserling itself is an online cross-browser testing service powered by alien technology. Check it out!

Secret message: If you love my tools, then I love you, too! Use coupon code TOOLLING to get a discount at my company.