n is the count of its digits in the base less one, so k(n) = 0 below the base, 1 from the base to base² - 1, and on; a tile at level k is the chosen design grown k times, of side base^k, and level 0 is the bare unit cell. MrlyUlam grows a cell only when n is prime and leaves one and every composite a unit cell; MrlySpiral grows every n by the same law and names no prime. The layout is one deterministic step: tile 1 has its lower-left corner at the origin, and the corner of tile n + 1 is the corner of tile n plus the unit step the square winding takes from n to n + 1, scaled by the side of tile n. Tiles overlap wherever the growth outruns the winding, so the drawn area is the sum of the tile squares and counts an overlap twice. This page is an exhibit: it states no theorem, and the two rules above are ours, fixed here and nowhere else. The same numbers on the plain unit grid are the ulam page, and the sieve that decides which of them grow is on the primes page.>}
controls={controls}>