A fractal which is constructed analogously to the Sierpiński sieve, but using squares instead of triangles. It can be constructed using string rewriting beginning with a cell [1] and iterating the rules
![{0->[0 0 0; 0 0 0; 0 0 0],1->[1 1 1; 1 0 1; 1 1 1]}.](http://mathworld.wolfram.com/images/equations/SierpinskiCarpet/NumberedEquation1.gif) |
(1)
|
Let
be the number of black boxes,
the length of a side of a white box, and
the fractional area of black boxes after the
th iteration. Then
The numbers of black cells after
, 1, 2, ... iterations are therefore 1, 8, 64, 512, 4096, 32768, 262144, ... (Sloane's A001018). The capacity dimension is therefore
(Sloane's A113210).