Students visualize a Sierpinski triangle and generate a sequence that counts the number of "black" triangles in the pattern. Then, they write recursive and non-recursive rules to represent the pattern.
Published 2025-05-14 · Watch on YouTube ↗ Availability and playback restrictions are controlled by the original channel.
13:25
