Table for CAN(3,k,19) 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,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).

Go to Global Menu.

Change t: - +

Change v: - +

k N Source 20 6859 orthogonal array 24 12159 fuse symbols 40 13357 Chateauneuf-Kreher doubling 380 19855 Colbourn-Martirosyan-Trung-Walker 400 26714 Cohen-Colbourn-Ling 456 28017 Colbourn-Martirosyan-Trung-Walker 475 29251 Colbourn-Martirosyan-Trung-Walker 494 29269 Colbourn-Martirosyan-Trung-Walker 513 29287 Colbourn-Martirosyan-Trung-Walker 532 29305 Colbourn-Martirosyan-Trung-Walker 551 30943 Colbourn-Martirosyan-Trung-Walker 570 30961 Colbourn-Martirosyan-Trung-Walker 589 30979 Colbourn-Martirosyan-Trung-Walker 608 30997 Colbourn-Martirosyan-Trung-Walker 684 31537 Colbourn-Martirosyan-Trung-Walker 703 31861 Colbourn-Martirosyan-Trung-Walker 722 32185 Colbourn-Martirosyan-Trung-Walker 760 32509 Colbourn-Martirosyan-Trung-Walker 800 33212 Cohen-Colbourn-Ling 7220 39007 Colbourn-Martirosyan-Trung-Walker 7581 45866 Colbourn-Martirosyan-Trung-Walker 7600 46190 Colbourn-Martirosyan-Trung-Walker 8664 50031 Colbourn-Martirosyan-Trung-Walker 9025 51265 Colbourn-Martirosyan-Trung-Walker 9101 51283 Colbourn-Martirosyan-Trung-Walker 9386 51319 Colbourn-Martirosyan-Trung-Walker 9500 51337 Colbourn-Martirosyan-Trung-Walker 9747 51355 Colbourn-Martirosyan-Trung-Walker 9880 51373 Colbourn-Martirosyan-Trung-Walker 10000 51391 Colbourn-Martirosyan-Trung-Walker

Graph: