Test If a Number Is Perfect
Ever wondered if a number is perfect or not? Test If a Number Is Perfect gives you a fast way to check. Just paste in some numbers, and the tool…
Ever wondered if a number is perfect or not? Test If a Number Is Perfect gives you a fast way to check. Just paste in some numbers, and the tool…
This tool generates a list of composite numbers based on how many you want. Composite numbers are integers greater than 1 that are not prime they have more than two…
This tool calculates the binary sequence behind the dragon curve, a classic fractal pattern. Each term is built by flipping and appending the previous string in a recursive way. You…
Use this tool to generate a list of deficient numbers integers where the sum of proper divisors (excluding the number itself) is less than the number. For example, 8 qualifies…
This tool generates a list of excessive numbers, also known as abundant numbers. These are integers whose proper divisors (excluding the number itself) add up to more than the number…
This tool creates a list of almost perfect numbers based on how many you want to see. An almost perfect number is one where the sum of its proper divisors…
This tool finds and displays the first perfect numbers based on your input count. A perfect number equals the sum of its proper divisors (excluding itself). For example, 6 is…
This tool lets you generate any number of Thue-Morse terms and see the output live. The sequence is built by calculating the parity of 1s in the binary form of…
This tool generates Baum-Sweet Numbers up to any count you choose. These values are binary-based: for each non-negative integer, the tool checks the binary string for blocks of zeros and…
This tool creates Rudin-Shapiro Numbers based on the count you enter. It uses each number’s binary form to decide the output. The moment you change the input or toggle a…
This tool creates the Gijswijt sequence based on your input count. You control how the results appear with options to add index numbers and switch between line-by-line or inline formatting.…
Use this tool to create a custom list of Stanley Numbers. You decide how many values to generate, whether to display them line-by-line, and if each number should include its…
This tool creates a Kolakoski sequence based on your preferences. You choose how many terms you want, whether to display the sequence line-by-line or inline, and whether to start with…
Use this tool to quickly generate a list of Moser de Bruijn Numbers with custom output formatting. You can toggle whether to include zero, switch between line-by-line or inline output,…
The Lucas Prime Test tool checks whether numbers are both part of the Lucas sequence and also prime. A Lucas number is part of a sequence that starts with 2…
The Generate Lucas Primes tool filters prime numbers from the Lucas sequence. Starting with 2 and 1, Lucas numbers grow with the same recurrence as Fibonacci numbers (Lₙ = Lₙ₋₁…
The Generate Negalucas Numbers tool calculates the first N values of the Negalucas sequence using a reversed recurrence. Unlike standard Lucas numbers, the Negalucas sequence uses alternating signs. It starts…
Construct Pentanacci Words creates a sequence of strings based on five initial inputs. Like the Pentanacci number sequence, each new word is generated by combining the previous five in reverse.…
The Construct Tetranacci Words tool generates strings using a recursive pattern based on four starting words. Each new word is formed by concatenating the last four in reverse order, creating…
The Construct Tribonacci Words tool lets you build a sequence of strings using a Tribonacci-style pattern. Starting with three initial words, each new word is formed by concatenating the previous…