Table for CAN(4,k,25) 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;4,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: -

k N Source

26 390625 orthogonal array

28 531439 orthogonal array

30 707277 orthogonal array

32 923515 orthogonal array

33 1048569 orthogonal array

50 1140601 Colbourn-Martirosyan-Trung-Walker

52 1155601 Colbourn-Martirosyan-Trung-Walker

56 1394360 Colbourn-Martirosyan-Trung-Walker

60 1683046 Colbourn-Martirosyan-Trung-Walker

625 1906249 Colbourn-Martirosyan-Trung-Walker

650 1936249 Colbourn-Martirosyan-Trung-Walker

675 2174359 Colbourn-Martirosyan-Trung-Walker

700 2204359 Colbourn-Martirosyan-Trung-Walker

725 2493045 Colbourn-Martirosyan-Trung-Walker

750 2523045 Colbourn-Martirosyan-Trung-Walker

775 2868835 Colbourn-Martirosyan-Trung-Walker

800 2883835 Colbourn-Martirosyan-Trung-Walker

825 3104193 Colbourn-Martirosyan-Trung-Walker

925 3196225 Colbourn-Martirosyan-Trung-Walker

1250 3376225 Colbourn-Martirosyan-Trung-Walker

1300 3391225 Colbourn-Martirosyan-Trung-Walker

1400 3786032 Colbourn-Martirosyan-Trung-Walker

1500 4187566 Colbourn-Martirosyan-Trung-Walker

10000 4501873 Colbourn-Martirosyan-Trung-Walker

Graph: