Sierpiński triangle
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Pascal's triangle, in two colours
Shade the odd numbers in Pascal's triangle and a fractal appears. Nothing was designed to produce it, and the same shape arrives independently from a completely different construction.
One tour through every position of the Tower of Hanoi
Draw every position of the Tower of Hanoi as a point and every legal move as a line, and the picture is a Sierpiński triangle. The famous shortest solution runs straight down one side of it, spelling the binary Gray code as it goes. The slowest honest solution threads through every position once and spells the ternary one. And unlike the cube the binary Gray code walks, which has 1,344 closed tours at four dimensions, the triangle has exactly one at every size.
Named alongside it
The objects these essays reach for when they reach for this one.
RecursionSelf-similarityBinomial coefficientExhaustive searchGraphGray codeHamiltonian cycleHypercubeKummer's theoremLucas' theoremParityPrimes