Table for CAN(3,k,2) 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,2) 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 4 8 orthogonal array 5 10 Johnson-Entringer 11 12 Sloane 12 15 tabu search (Nurmela) 14 16 Sloane 16 17 Sloane 20 18 Chateauneuf-Kreher doubling 22 19 Chateauneuf-Kreher doubling 24 22 Chateauneuf-Kreher doubling 28 23 Chateauneuf-Kreher doubling 30 24 Chateauneuf-Kreher doubling 32 25 Chateauneuf-Kreher doubling 40 26 Chateauneuf-Kreher doubling 44 27 Chateauneuf-Kreher doubling 48 30 Chateauneuf-Kreher doubling 56 31 Chateauneuf-Kreher doubling 64 32 Sloane 121 34 Power 11^2 128 42 Chateauneuf-Kreher doubling 144 43 Power 12^2 242 44 Chateauneuf-Kreher doubling 253 46 Sloane 256 49 Power 16^2 400 52 Power 20^2 484 55 Power 22^2 1331 56 Power 11^3 1584 69 Chateauneuf-Kreher doubling 2662 70 Chateauneuf-Kreher doubling 10000 78 Power 11^4

Graph: