Created by Browserling
This online program creates a zigzag from integer digits and prints them in a triangle-like snake shape in the output. The zigzag can start from the top, bottom, or any other position and it can be of any height. You can adjust how many digits go in each segment of the integer snake, add an extra distance between segments, and fill the empty space with custom characters. Created by math nerds from team Browserling.
With this browser-based utility, you can make integers go in zigzags. The integers are split into individual digits and the digits are then rearranged so that a triangular wave shape is created. The wave is formed by moving each digit in the order it appears in the integer to a higher or lower line. This wave is also sometimes called the digital snake or digital worm, and it can start its movement from any line and can go up or down. If the top starting position is selected (in the options), the first digit is placed in the first column of the top-most line and the snake will go down. If the bottom position is selected, the snake will begin from the lowest spot and move upward to the next value. To start in the middle, select the custom start mode and specify the starting position and the initial movement. For example, "2u" means start at the second row from the top and move up or "3d" means start from the third line from the bottom and move down. The number of horizontal lines in the zigzag determines its height and it can be specified in the options. By default, one digit creates one segment of the zigzag but it can be also changed in the options. The number of digits in the segment is called the segment length. The segments are combined together at various heights to create the whole zigzag. You can create any number of digital worms from many integers at once. To do it, put each integer on a new line in the input box. When creating the integer worms, the empty space around the digits is filled with the white-space characters, but you can use any other filling character. You can also stretch the worm by adding extra fill characters between its segments. Integerabulous!
In this example, we create a small integer zigzag from twenty digits with an amplitude of two. We start the zigzag from the top row, moving down first, then up, then down again, then up again, and so on. As the height of the wave is two, it fits on two lines and the digits alternate between to first and second rows. The length of wave sections is one digit long and the spaces between the digits are filled with empty symbols.
In this example, we simultaneously turn three integers into wavy snake-like shapes. We set the segment size to two that groups the digits in pairs and start the wave from below, reaching the full height in two steps and making a full oscillation in four steps. We expand the wave horizontally, adding an extra space between all pairs of digits and use the dash symbol to fill the distance between them.
This example loads unusual Unicode boxes with digits in the input and converts them into a digit snake in the output. It uses empty blue boxes as background filling symbols and draws the digit boxes from a custom starting position "2d". This notation starts the snake at the 2nd position and makes it go down at the first step. The snake's height is set to three digits and in the output, we get a symmetrical shape similar to the Latin letter "W".
You can pass input to this tool via ?input query argument and it will automatically compute output. Here's how to type it in your browser's address bar. Click to try!
Quickly rewrite integer digits using pretty Unicode glyphs.
Quickly generate random two-dimensional integer points.
Quickly generate random three-dimensional integer points.
Quickly print a list of integers that are palindromes.
Quickly convert the given integer to a palindromic integer.
Quickly find all integers in the given text or string.
Quickly make integer digits go in a triangle wave.
Quickly unleash the destructive force of Zalgo on integers.
Quickly find two or more integers that add up to the given integer.
Quickly find several integers that multiply up to the given integer.
Quickly randomize the given sequence of integers.
Quickly mix the order of digits in an integer.
Quickly put integers in increasing or decreasing order.
Quickly sort the individual digits of an integer.
Quickly increase all integers by a certain amount.
Quickly increase individual digits by a certain amount.
Quickly decrease all integers by a certain amount.
Quickly decrease individual digits by a certain amount.
Quickly randomly select an integer from a list of integers.
Quickly create groups from the digits of an integer.
Quickly write integer digits backwards.
Quickly remove one or more digits from an integer.
Quickly replace one or more digits in an integer.
Quickly drop digits from an integer and make it shorter.
Quickly add the thousands separator to integers.
Quickly remove the thousands separator from integers.
Quickly find the largest integer in a list of integers.
Quickly find the smallest integer in a list of integers.
Quickly find the total sum of a bunch of integers.
Quickly find the sum of all the digits in an integer.
Quickly find the total product of a bunch of integers.
Quickly find the product of all the digits in an integer.
Quickly calculate the partial sum of a bunch of integers.
Quickly calculate the partial product of a bunch of integers.
Quickly flip the sign of one or more integers.
Quickly split an integer into chunks of a given length.
Quickly merge partial integers together to form a larger integer.
Quickly round integers up or down to the required precision.
Quickly convert integers to a downloadable picture.
Quickly generate a list of von Neumann ordinals.
Quickly generate a list of Zermelo ordinals.
Quickly generate an ordered sequence of integers.
Quickly generate an ordered list of even integers.
Quickly generate an ordered list of odd integers.
Quickly write an integer spelling in words.
Quickly convert spelled integers to regular integers with digits.
Quickly generate an array of integers for programming.
Quickly find the number of occurrences of digits in integers.
Create a drawing that visualizes von Neumann hierarchy of sets.
Create a sudoku puzzle.
Create a list of neat-looking integers (called magic integers).
Generate a list of tuples of integers with n elements.
Quickly convert integers to base one.
Quickly convert base one to integers.
Quickly convert integers to base two.
Quickly convert base two to integers.
Quickly convert integers to base eight.
Quickly convert base eight to integers.
Quickly convert integers to base sixteen.
Quickly convert base sixteen to integers.
Quickly encode integers to base-64.
Quickly decode base-64 to integers.
Quickly convert integers to a custom base.
Quickly encode integers to HTML encoding.
Quickly decode HTML entities to integers.
Quickly encode integers to URL (percent) encoding.
Quickly decode URL-encoded integers.
Quickly convert a signed integer to an unsigned integer.
Quickly convert an unsigned integer to a signed integer.
Generate a list of random integers.
Check if the given integers are palindromes.
Create a matrix whose entries are all integers.
Create a vector with integer coefficients.
Quickly calculate the average value of integers.
Quickly calculate the average value of integer digits.
Quickly randomly select a digit from an integer.
Find which of the given integers is the biggest or smallest.
Limit integer values to a range.
Limit integer digit values to a range.
Create multiple copies of the input integers.
Create multiple copies of digits of input integers.
Rotate the digits of an integer to the left or right.
Move the digits of an integer to the left or right.
Quickly find the difference of a bunch of integers.
Quickly apply the bitwise AND operation to integers.
Quickly apply the bitwise OR operation to integers.
Quickly apply the bitwise XOR operation to integers.
Quickly apply the bitwise NOT operation to integers.
Quickly apply the bitwise NAND operation to integers.
Quickly apply the bitwise NOR operation to integers.
Quickly apply the bitwise NXOR operation to integers.
Quickly divide two or more integers.
Quickly divide the digits of an integer.
Add -st, -nd, -rd, -th suffixes to integers to make them ordinals.
Remove -st, -nd, -rd, -th suffixes from ordinals to make them ints.
Find integers that match a filter (greater, less, equal).
Add padding to integers on the left side.
Add padding to integers on the right side.
Position all integers so that they align on the right.
Position all integers so that they align in the middle.
Turn all integers into positive integers.
Turn all integers into negative integers.
Rewrite an integer in fractional form.
Extract the numerator and denominator from a fraction.
Search for all occurrences of an integer and replace it.
Create a regex that matches the given integers.
Create integers that match the given regular expression.
Create relatively tiny integers.
Create relatively huge integers.
Create a sequence of oscillating integers, such as 123212321.
Create multiple integer sequences at once.
Slightly change an integer so it has an error.
Slightly change integer digits so there are errors.
Apply fuzzing to integers and add perturbations.
Apply fuzzing to integer digits and add digit perturbations.
Add highlighting to certain integers.
Add highlighting to certain integer digits.
Add color to integers based on a condition.
Add color to individual digits in the given integers.
Quickly assign colors to integers and draw them as pixels.
Quickly assign integer values to pixel colors and print them.
Make the digits of an integer go in a spiral shape.
Make the digits of an integer go in a circle.
Make the digits of an integer go in a diamond shape.
Fill a box with certain width and height with digits.
Use ASCII art to convert integers to 2-dimensional drawings.
Use ASCII art to convert integers to 3-dimensional drawings.
Decompose an integer into ones, tens, hundreds, etc.
Generate an ordered list of increasing integers.
Generate an ordered list of decreasing integers.
Quickly find various information about the given integers.
Find hidden patterns of numbers in integers.
Find the Shannon entropy of an integer.
Subscribe to our updates. We'll let you know when we release new tools, features, and organize online workshops.
Enter your email here
