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

Last Updated Sat Nov 14 06:41:39 MST 2009

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.

k N Source 24 12167 orthogonal array 26 15621 orthogonal array fuse fuse 28 19675 orthogonal array fuse fuse fuse fuse 48 23805 Chateauneuf-Kreher doubling 52 29217 Chateauneuf-Kreher doubling 54 33337 Chateauneuf-Kreher doubling 56 33381 Chateauneuf-Kreher doubling 552 35443 Colbourn-Martirosyan-Trung-Walker 598 40855 Colbourn-Martirosyan-Trung-Walker 600 42167 Colbourn-Martirosyan-Trung-Walker 621 44975 Colbourn-Martirosyan-Trung-Walker 644 45019 Colbourn-Martirosyan-Trung-Walker 650 45621 Colbourn-Martirosyan-Trung-Walker fuse fuse 667 51041 Colbourn-Martirosyan-Trung-Walker 690 51085 Colbourn-Martirosyan-Trung-Walker 713 51195 Colbourn-Martirosyan-Trung-Walker 736 51239 Colbourn-Martirosyan-Trung-Walker 759 53043 Colbourn-Martirosyan-Trung-Walker 782 53065 Colbourn-Martirosyan-Trung-Walker 805 53131 Colbourn-Martirosyan-Trung-Walker 828 53153 Colbourn-Martirosyan-Trung-Walker 851 55045 Colbourn-Martirosyan-Trung-Walker 874 55243 Colbourn-Martirosyan-Trung-Walker 897 55287 Colbourn-Martirosyan-Trung-Walker 920 55353 Colbourn-Martirosyan-Trung-Walker 943 56035 Colbourn-Martirosyan-Trung-Walker 966 56101 Colbourn-Martirosyan-Trung-Walker 1104 58213 Colbourn-Martirosyan-Trung-Walker 1152 59248 Cohen-Colbourn-Ling 1196 63625 Colbourn-Martirosyan-Trung-Walker 1248 64660 Cohen-Colbourn-Ling 1288 67789 Colbourn-Martirosyan-Trung-Walker 1296 68780 Cohen-Colbourn-Ling 1344 68824 Cohen-Colbourn-Ling 10000 69851 Colbourn-Martirosyan-Trung-Walker

Graph: