Sierpinski triangle
A Sierpinski triangle or Sierpinski triangle gasket is a fractal resulting from doing the following:[1]
- Start with an equilateral triangle.
- Remove center part.
- Do the same for the three largest equilateral triangles left in this one.
If this is done, the first few steps will look like this:
If this is done an infinite number of times, its area will be 0.
They can also be 3D:
Sierpinski Triangle Media
Sierpiński triangle in logic: The first 16 conjunctions of lexicographically ordered arguments. The columns interpreted as binary numbers give 1, 3, 5, 15, 17, 51... (sequence [{{fullurl:OEIS:{{{id}}}}} {{{id}}}] in OEIS)
Sierpiński pyramid as light installation fractal on the Tetrahedron in Bottrop, Germany
Each subtriangle of the nth iteration of the deterministic Sierpinski triangle has an address on a tree with n levels (if n=∞ then the tree is also a fractal); T=top/center, L=left, R=right, and these sequences can represent both the deterministic form and, "a series of moves in the chaos game"
References
- ↑ "Cynthia Lanius' Fractals Unit: The Sierpinski Triangle". Math.rice.edu. Archived from the original on 2011-10-30. Retrieved 2011-10-28.