Generate Pascal’s triangle to any row, with the last row, its sum and binomial coefficients.
Result
How to use this tool
Enter how many rows to generate (1 to 25).
Read all rows, separated by semicolons.
Use the last row as binomial coefficients for an expansion.
Check that the last row sums to 2^(rows − 1).
Formula & worked example
The first 5 rows end in row 5: 1, 4, 6, 4, 1, which sums to 16.
Limitations — read this before you rely on it
Rows capped at 25 for readability and integer precision; coefficients beyond that can exceed exact floating-point integers.
Frequently asked questions
Each entry is the sum of the two entries above it; every row starts and ends with 1.
Row n (1-based) holds the binomial coefficients C(n − 1, k): the coefficients of (x + y)^(n−1).
Setting x = y = 1 in the binomial expansion gives (1 + 1)^(n−1) = 2^(n−1).
For row 5 it is 6 = C(4, 2): the largest coefficient in that row.
Coefficients grow fast (row 25 already reaches millions), and the display stays readable.