Work out pascal triangle row instantly with clear inputs, formula shown and shareable results.
Row n of Pascal's triangle holds the binomial coefficients C(n, 0) through C(n, n), each the sum of the two entries above it. The row always totals 2ⁿ.
Pascal entry
entry(n, k) = C(n, k) = n! / (k!(n−k)!)
Row sum
Σₖ C(n, k) = 2ⁿ
1, 6, 15, 20, 15, 6, 1 — totalling 64 = 2⁶.
Because C(n, k) = C(n−1, k−1) + C(n−1, k): a subset either contains the new element or it does not.