Statistical Tables · free & public domain

Runs Test Critical Values

Lower and upper critical run counts at α = 0.05 for testing a sequence for randomness.

How to use this table

Count the runs — each unbroken stretch of the same symbol is one run. Find n₁ (count of one symbol) down the side and n₂ (the other) across the top. Reject randomness if the number of runs is ≤ the lower value or ≥ the upper value. Example: n₁ = 10, n₂ = 10 → reject if runs ≤ 6 or ≥ 16. Too few runs means clustering; too many means over-alternation.

The table

bound lower — reject if runs ≤
Runs Test Critical Values — lower — reject if runs ≤
n₁ / n₂2345678910111213141516171819202122232425
222222222222222
322222222333333333333
4222333333334444444444
52233333444444455555555
622333344445555556666666
722333445555566666677777
823334455566666777778888
923344555666777788888899
10233455566777788889999910
112344556677788899991010101010
122234456677788899910101010111111
13223455667788999101010101111111112
142334556778899910101011111112121212
1523345667788991010111111121212121313
16234456678899101011111112121213131314
172344567789910101111111212131313141414
182345567889910101111121213131314141415
1923456678891010111112121313131414151515
2023456678991010111212131313141415151516
21234567789101011111212131314141515161616
22234567889101011121213131414151516161617
23234567889101111121213141415151616161717
24234567899101111121313141415151616171718
252345678910101112121314141515161617171818
bound upper — reject if runs ≥
Runs Test Critical Values — upper — reject if runs ≥
n₁ / n₂2345678910111213141516171819202122232425
26666666666666666666666
3888888888888888888888
469910101010101010101010101010101010101010
5689101011111212121212121212121212121212121212
6689101112121313131314141414141414141414141414
76810111213131414141415151516161616161616161616
86810111213141415151616161617171717171818181818
96810121314141516161617171818181818181919191919
106810121314151616171718181819191920202020202020
116810121314151617171819191920202021212122222222
126810121314161617181919202021212122222222232323
136810121415161718191920202121222223232324242424
146810121415161718192020212222232323242424252525
156810121415161818192021222223232424252525262626
166810121416171819202121222323242525252626272727
176810121416171819202122232324252526262727272828
186810121416171819202122232425252626272728282929
196810121416171820212223232425262627272829292930
206810121416171820212223242525262727282929303031
216810121416181920212223242526272728292930303131
226810121416181920222224242526272829293030313132
236810121416181920222324252627272829303031323233
246810121416181920222324252627282929303131323333
256810121416181920222324252627282930313132333334

A dash means no rejection is possible on that side at these sample sizes. The table is symmetric in n₁ and n₂, and runs to n = 25.

How these values were produced

Exact distribution of the number of runs in a binary sequence. Tabulated by Swed & Eisenhart (1943), Ann. Math. Statist. 14(1), 66–87.

Every one of these 1,152 values was computed from the underlying distribution — none was transcribed from a printed table. Values of this kind are mathematical facts: they come out the same for anyone who computes them correctly.

A deliberate difference. This table uses the conservative construction — the critical value is the last one whose true tail probability stays at or below α, so the real error rate never exceeds the level you asked for. Several widely printed versions instead pick whichever value lands nearest α, which can push the true rate above the nominal level. At n = 5, α = 0.05 a Wilcoxon test built that way actually runs at 0.0625.

Need the test run rather than the critical value looked up? The Proof Workbench computes t, r, χ² and ANOVA in your browser with assumption checks and a re-verifiable receipt.

Use it freely

This table is dedicated to the public domain under CC0 1.0. No attribution required, no signup, no limits — copy it into a lecture, a textbook, or your own site. A link back is welcome but not asked for.

The other tables