one triangle · Sierpinski · Fibonacci · powers of 2 · triangular numbers · click any cell to see its construction · runs locally
C(n,k) = C(n-1,k-1) + C(n-1,k) · click any cell to see its parents · mod 2 → Sierpinski · diagonal sums → 1,1,2,3,5,8,… (fibonacci) · row sums → 1,2,4,8,… (2^n)