Table for CAN(2,k,13) for k up to 20000

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;2,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
14169orthogonal array
20246heuristic exchange (Nayeri-Colbourn)
21253group 1-rotational (Meagher-Stevens, Colbourn)
22265group 1-rotational (Meagher-Stevens, Colbourn)
23277group 1-rotational (Meagher-Stevens, Colbourn)
24289group 1-rotational (Meagher-Stevens, Colbourn)
25301group 1-rotational (Meagher-Stevens, Colbourn)
26313group 1-rotational (Meagher-Stevens, Colbourn)
195325CMMSSY 2.3
196337CMMSSY 2.3
237405CMMSSY 2.3
252407CMMSSY 2.3
266408CMMSSY 2.3
293409CMMSSY 2.3
307421CMMSSY 2.3
321433CMMSSY 2.3
335445CMMSSY 2.3
349457CMMSSY 2.3
363469CMMSSY 2.3
2717481CMMSSY 2.3
2730493CMMSSY 2.3
3302561CMMSSY 2.3
3510563CMMSSY 2.3
3705564CMMSSY 2.3
4082565CMMSSY 2.3
4277577CMMSSY 2.3
4472589CMMSSY 2.3
4667601CMMSSY 2.3
4862613CMMSSY 2.3
5057625CMMSSY 2.3
20000637CMMSSY 2.3
 Graph: