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

Last Updated Tue Nov 18 04:23:58 MST 2014

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,19) 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
206859orthogonal array
2111791orthogonal array fuse fuse fuse fuse postop NCK
2211823orthogonal array fuse fuse fuse fuse postop NCK
2311847orthogonal array fuse fuse fuse fuse postop NCK
2411869orthogonal array fuse fuse fuse fuse postop NCK
4013357Chateauneuf-Kreher doubling
38113717Raaphorst-Moura-Stevens
38220215Add a factor
40024158Cohen-Colbourn-Ling
55324325Raaphorst-Moura-Stevens fuse fuse fuse fuse
76226371Chateauneuf-Kreher doubling
85532095Colbourn-Martirosyan-Trung-Walker
87432329Colbourn-Martirosyan-Trung-Walker
89332563Colbourn-Martirosyan-Trung-Walker
95032779Colbourn-Martirosyan-Trung-Walker
723932869Colbourn-Martirosyan-Trung-Walker
762037496Cohen-Colbourn-Ling
794242748Cohen-Colbourn-Ling
830342880Cohen-Colbourn-Ling
866442902Cohen-Colbourn-Ling
902544462Cohen-Colbourn-Ling
938644534Cohen-Colbourn-Ling
974744642Cohen-Colbourn-Ling
1000044714Cohen-Colbourn-Ling
 Graph: