Table for CAN(3,k,25) 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,25) 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 26 15625 orthogonal array 28 19679 orthogonal array fuse fuse 30 24381 orthogonal array fuse fuse fuse fuse 32 29779 orthogonal array fuse fuse fuse fuse fuse fuse 52 30625 Chateauneuf-Kreher doubling 54 37007 Chateauneuf-Kreher doubling 56 37031 Chateauneuf-Kreher doubling 58 41781 Chateauneuf-Kreher doubling 60 41829 Chateauneuf-Kreher doubling 650 45625 Colbourn-Martirosyan-Trung-Walker 675 52007 Colbourn-Martirosyan-Trung-Walker 700 52031 Colbourn-Martirosyan-Trung-Walker 725 56781 Colbourn-Martirosyan-Trung-Walker 750 56829 Colbourn-Martirosyan-Trung-Walker 775 64483 Colbourn-Martirosyan-Trung-Walker 800 64603 Colbourn-Martirosyan-Trung-Walker 825 65473 Colbourn-Martirosyan-Trung-Walker 850 65593 Colbourn-Martirosyan-Trung-Walker 875 67705 Colbourn-Martirosyan-Trung-Walker 900 67777 Colbourn-Martirosyan-Trung-Walker 925 67849 Colbourn-Martirosyan-Trung-Walker 950 67945 Colbourn-Martirosyan-Trung-Walker 975 69049 Colbourn-Martirosyan-Trung-Walker 1000 69073 Colbourn-Martirosyan-Trung-Walker 1025 74137 Colbourn-Martirosyan-Trung-Walker 1250 74857 Colbourn-Martirosyan-Trung-Walker 1300 75025 Colbourn-Martirosyan-Trung-Walker 1352 76250 Cohen-Colbourn-Ling 1400 81431 Colbourn-Martirosyan-Trung-Walker 1404 82632 Cohen-Colbourn-Ling 1456 82656 Cohen-Colbourn-Ling 1500 86229 Colbourn-Martirosyan-Trung-Walker 1508 87406 Cohen-Colbourn-Ling 1560 87454 Cohen-Colbourn-Ling 10000 90025 Colbourn-Martirosyan-Trung-Walker

Graph: