- Aliquot sequences Finds n terms starting at m.
- Inverse aliquot function Finds all k such that s(k) = i.
- Primitive Pythagorean triples Lists all primitive Pythagorean triples containing a given number.
- Pythagorean triples Lists all Pythagorean triples containing a given number. Singles out the primitive ones.
- Sum of 4 squares Lists all ways to write a number as a sum of 4 squares.
- Sum of 9 cubes Lists all ways to write a number as a sum of 9 cubes.
- Difference of 2 squares Lists all ways to write a number as a difference of 2 squares.
- Sum of 2 odd primes Lists all ways to write an even number as a sum of 2 primes.
- Sum of 3 odd primes Lists all ways to write an odd number as a sum of 3 primes.

- Reverse and add algorithm Iterates this procedure until a palindrome is reached or the numbers get too large.
- English gematria Calculates the numerical value of English words and phrases.
- Wolfram elementary automata Displays behavior on a single black cell.
- Strictly ascending primes Lists them all in your choice of base.
- Inverse of phi Computes the inverse totient of k for (even) k between m and n.
- Roman numerals Converts to roman numerals. Gives the alphabetic value of the result. For n numbers starting at m.