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

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,13) 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).

Go to Global Menu.

Change t: - +

Change v: - +
kNSource
142197orthogonal array
184090fuse symbols
284225Chateauneuf-Kreher doubling
594381Sherwood-Martirosyan-Colbourn
1826253Colbourn-Martirosyan-Trung-Walker
2006565Sherwood-Martirosyan-Colbourn
2349070Colbourn-Martirosyan-Trung-Walker
2609205Colbourn-Martirosyan-Trung-Walker
2739289Colbourn-Martirosyan-Trung-Walker
2869433Colbourn-Martirosyan-Trung-Walker
2999577Colbourn-Martirosyan-Trung-Walker
3129721Colbourn-Martirosyan-Trung-Walker
3259865Colbourn-Martirosyan-Trung-Walker
33810009Colbourn-Martirosyan-Trung-Walker
36410153Colbourn-Martirosyan-Trung-Walker
76710309Colbourn-Martirosyan-Trung-Walker
82610634Cohen-Colbourn-Ling
236612181Colbourn-Martirosyan-Trung-Walker
253512493Colbourn-Martirosyan-Trung-Walker
254812637Colbourn-Martirosyan-Trung-Walker
260013417Colbourn-Martirosyan-Trung-Walker
280014846Cohen-Colbourn-Ling
304215922Colbourn-Martirosyan-Trung-Walker
338016057Colbourn-Martirosyan-Trung-Walker
339316141Colbourn-Martirosyan-Trung-Walker
345816213Colbourn-Martirosyan-Trung-Walker
354916225Colbourn-Martirosyan-Trung-Walker
371816369Colbourn-Martirosyan-Trung-Walker
380916513Colbourn-Martirosyan-Trung-Walker
388716657Colbourn-Martirosyan-Trung-Walker
399116801Colbourn-Martirosyan-Trung-Walker
405616945Colbourn-Martirosyan-Trung-Walker
417317089Colbourn-Martirosyan-Trung-Walker
422517233Colbourn-Martirosyan-Trung-Walker
435517377Colbourn-Martirosyan-Trung-Walker
439417521Colbourn-Martirosyan-Trung-Walker
453717665Colbourn-Martirosyan-Trung-Walker
471917809Colbourn-Martirosyan-Trung-Walker
473217953Colbourn-Martirosyan-Trung-Walker
997118109Colbourn-Martirosyan-Trung-Walker
1000018434Colbourn-Martirosyan-Trung-Walker
 Graph: