🔢 Pascal's Triangle

Color mode:
Click or hover a cell to inspect.
Rows shown—
Sum of last row—
Max coefficient—
Total cells—
Pascal's Triangle
C(n,k) = C(n−1,k−1) + C(n−1,k)
Row sum = 2n  |  C(n,k) = n!/(k!(n−k)!)
Parity pattern forms Sierpiński triangle; shallow diagonal gives Fibonacci numbers.

Related simulations

🎨 Graph Coloring 🔢 Inclusion-Exclusion Principle — Venn Diagrams & Counting 🔢 Number Spirals 🎂 Birthday Paradox — Probability Simulation 🔢 Benford's Law 📈 Taylor Series Visualizer

Learn more

📖 Golden Ratio & Fibonacci: Phyllotaxis, Continued Fractions & Spirals