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

Last Updated Tue Jan 31 05:19:41 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;4,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 279841 orthogonal array 26 390621 orthogonal array fuse fuse 28 531433 orthogonal array fuse fuse fuse fuse 47 641677 Derive from strength 5 48 826805 Colbourn-Martirosyan-Trung-Walker 51 886871 Derive from strength 5 fuse fuse 52 1013419 Colbourn-Martirosyan-Trung-Walker 69 1106139 Colbourn-Martirosyan-Trung-Walker 529 1362175 Colbourn-Martirosyan-Trung-Walker 552 1618211 Colbourn-Martirosyan-Trung-Walker 598 1804803 Colbourn-Martirosyan-Trung-Walker 625 1905621 Colbourn-Martirosyan-Trung-Walker fuse fuse 644 2033901 Colbourn-Martirosyan-Trung-Walker 1081 2236083 Colbourn-Martirosyan-Trung-Walker 1104 2421211 Colbourn-Martirosyan-Trung-Walker 1173 2599197 Colbourn-Martirosyan-Trung-Walker 1196 2725745 Colbourn-Martirosyan-Trung-Walker 1242 2908203 Colbourn-Martirosyan-Trung-Walker 1288 2909655 Colbourn-Martirosyan-Trung-Walker 1587 2956581 Colbourn-Martirosyan-Trung-Walker 10000 3212617 Colbourn-Martirosyan-Trung-Walker

Graph: