Table for CAN(3,k,11) for k up to 10000

Last Updated Sat Nov 14 06:41:39 MST 2009

Locate the k in the first column that is at least as large as the number of factors in which you are interested. Then let N be the number of rows (tests) given in the second column. A CA(N;3,k,11) exists according to a construction in the reference (cryptically) given in the third column. The accompanying graph plots N vertically against log k (base 10).

Change t: - + Change v: - + or go to Global Menu.
kNSource
121331orthogonal array
142090orthogonal array fuse fuse postop NCK
242541Chateauneuf-Kreher doubling
502651Sherwood-Martirosyan-Colbourn
1323751Colbourn-Martirosyan-Trung-Walker
1463971Sherwood-Martirosyan-Colbourn
3984378Cyclotomy (Colbourn)
4194609Cyclotomy (Colbourn)
4205819Add a factor
5506171Colbourn-Martirosyan-Trung-Walker
6006402Cohen-Colbourn-Ling
6027222Cyclotomy (Colbourn) fuse
14527271Colbourn-Martirosyan-Trung-Walker
15737491Colbourn-Martirosyan-Trung-Walker
15847591Colbourn-Martirosyan-Trung-Walker
15957841Colbourn-Martirosyan-Trung-Walker
16067851Colbourn-Martirosyan-Trung-Walker
17168258Colbourn-Martirosyan-Trung-Walker
18378288Colbourn-Martirosyan-Trung-Walker
21018298Colbourn-Martirosyan-Trung-Walker
21128358Colbourn-Martirosyan-Trung-Walker
22338398Colbourn-Martirosyan-Trung-Walker
23658498Colbourn-Martirosyan-Trung-Walker
23768588Colbourn-Martirosyan-Trung-Walker
24978598Colbourn-Martirosyan-Trung-Walker
28058698Colbourn-Martirosyan-Trung-Walker
28168758Colbourn-Martirosyan-Trung-Walker
29818798Colbourn-Martirosyan-Trung-Walker
29928858Colbourn-Martirosyan-Trung-Walker
31688898Colbourn-Martirosyan-Trung-Walker
31908988Colbourn-Martirosyan-Trung-Walker
43788998Colbourn-Martirosyan-Trung-Walker
46099229Colbourn-Martirosyan-Trung-Walker
47769339Cohen-Colbourn-Ling
50289570Cohen-Colbourn-Ling
504010780Cohen-Colbourn-Ling
605010791Colbourn-Martirosyan-Trung-Walker
660011022Colbourn-Martirosyan-Trung-Walker
715011242Cohen-Colbourn-Ling
720011363Cohen-Colbourn-Ling
1000011891Colbourn-Martirosyan-Trung-Walker
 Graph: