Tested tool guide
Tested browser tools
Checked August 16, 2026
What pascals-triangle-explorer does, with a checked example
This tool builds Pascal's triangle row by row using the addition rule (each interior entry is the sum of the two entries above it) and layers optional highlighting on top: odd/even shading that reveals the Sierpinski gasket, diagonal readouts that sum to Fibonacci numbers, and row-sum readouts that equal powers of two. The numbers underneath never change; only the coloring and annotations do. What trips people up most is indexing - both rows and positions within a row start at 0, so 'the 5th number in row 6' visually is not C(6,5); it's whichever 0-indexed entry you actually meant.
Worked example
A concrete input and expected output from the current implementation.
Input
Set rows = 6 (rows 0 through 5), binomial coefficient labels on
->
Expected output
Row 0: 1
Row 1: 1 1
Row 2: 1 2 1
Row 3: 1 3 3 1
Row 4: 1 4 6 4 1
Row 5: 1 5 10 10 5 1
Each row starts and ends in 1; every interior value is the sum of the two values diagonally above it (e.g. row 5's 10 = 4+6 from row 4), which is equivalent to C(n,k) for row n, position k.