Connect via MCP →

Enter Calculation

Formula

Advertisement

Results

Sum of all combinations (2n)
1073741824
total over r = 0 to 30 (31 rows)
r nCr (number of combinations)
0 1
1 30
2 435
3 4060
4 27405
5 142506
6 593775
7 2035800
8 5852925
9 14307150
10 30045015
11 54627300
12 86493225
13 119759850
14 145422675
15 155117520
16 145422675
17 119759850
18 86493225
19 54627300
20 30045015
21 14307150
22 5852925
23 2035800
24 593775
25 142506
26 27405
27 4060
28 435
29 30
30 1

What is the Combinations nCr Table Calculator?

This tool tabulates the binomial coefficient nCr - the number of ways to choose r distinct items from a set of n distinct items when order does not matter - for every value of \(r\) from 0 up to \(n\). Enter a single value of \(n\) and the calculator produces an \((n+1)\)-row table together with the row total, which is always 2 to the power \(n\). It supports \(n\) up to 300 using arbitrary-precision arithmetic, so even astronomically large coefficients such as \(\binom{300}{150}\) (about 89 digits) are computed exactly.

How to use it

Enter the number of items \(n\) (a non-negative integer, maximum 300). Choose a display precision in significant digits if you want to shorten very large numbers in the output; this only affects how the bigger values are shown and never changes the underlying math. Press calculate to see the full table of nCr values and the \(2^{n}\) total of all rows.

The formula explained

The combinations formula is $$\binom{n}{r} = \frac{n!}{r!\,(n-r)!}.$$ To avoid overflowing factorials, the calculator uses the multiplicative recurrence \(\binom{n}{0} = 1\) and \(\binom{n}{r} = \binom{n}{r-1} \cdot \frac{n - r + 1}{r}\). Each step stays exact with big-integer math. By symmetry \(\binom{n}{r}\) equals \(\binom{n}{n-r}\), and the total over all \(r\) equals the size of the power set, $$\sum_{r=0}^{n} \binom{n}{r} = 2^{n}.$$

Advertisement
Pascal's triangle showing rows of binomial coefficients with each number formed by adding the two above it
Pascal's triangle: each nCr is the sum of the two values above it.

Worked example (n = 5)

\(\binom{5}{0} = 1\), \(\binom{5}{1} = 5\), \(\binom{5}{2} = 10\), \(\binom{5}{3} = 10\), \(\binom{5}{4} = 5\), \(\binom{5}{5} = 1\). The row sum is $$1 + 5 + 10 + 10 + 5 + 1 = 32,$$ which equals \(2^{5}\). As a check, $$\binom{6}{2} = \frac{6!}{2!\,\cdot\,4!} = \frac{720}{2 \cdot 24} = 15.$$

Bar chart of the row n=5 binomial coefficients 1,5,10,10,5,1 forming a symmetric bell shape
The n = 5 row (1, 5, 10, 10, 5, 1) is symmetric and sums to \(2^{5} = 32\).

FAQ

Why does the table have n+1 rows? Because \(r\) runs from 0 to \(n\) inclusive, giving \(n+1\) distinct choose counts.

What does nC0 mean? Choosing nothing - there is exactly one way to do that, so \(\binom{n}{0} = 1\), and likewise \(\binom{n}{n} = 1\).

Why allow up to 50 significant digits? Large coefficients have many digits; standard double precision loses accuracy past about 15-16 figures, so the display-precision selector lets you show exact-looking values without truncation.

Last updated: