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

Last Updated Thu Jan 5 06:12:57 MST 2012

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,23) 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
2412167orthogonal array
2615613orthogonal array fuse fuse postop NCK
2819626orthogonal array fuse fuse fuse fuse postop NCK
4823805Chateauneuf-Kreher doubling
5229165Chateauneuf-Kreher doubling
5433244Chateauneuf-Kreher doubling
5633310Chateauneuf-Kreher doubling
55235443Colbourn-Martirosyan-Trung-Walker
59840803Colbourn-Martirosyan-Trung-Walker
62144882Colbourn-Martirosyan-Trung-Walker
64444948Colbourn-Martirosyan-Trung-Walker
65045621Colbourn-Martirosyan-Trung-Walker fuse
66750975Colbourn-Martirosyan-Trung-Walker
69051019Colbourn-Martirosyan-Trung-Walker
71351107Colbourn-Martirosyan-Trung-Walker
73651151Colbourn-Martirosyan-Trung-Walker
78252889Colbourn-Martirosyan-Trung-Walker
80552955Colbourn-Martirosyan-Trung-Walker
82852999Colbourn-Martirosyan-Trung-Walker
85154737Colbourn-Martirosyan-Trung-Walker
87454759Colbourn-Martirosyan-Trung-Walker
89754781Colbourn-Martirosyan-Trung-Walker
92054847Colbourn-Martirosyan-Trung-Walker
94355727Colbourn-Martirosyan-Trung-Walker
96655815Colbourn-Martirosyan-Trung-Walker
110457861Colbourn-Martirosyan-Trung-Walker
115259248Cohen-Colbourn-Ling
119663221Colbourn-Martirosyan-Trung-Walker
124864608Cohen-Colbourn-Ling
128867366Colbourn-Martirosyan-Trung-Walker
129668687Cohen-Colbourn-Ling
134468753Cohen-Colbourn-Ling
138069565Colbourn-Martirosyan-Trung-Walker
1000069851Colbourn-Martirosyan-Trung-Walker
 Graph: