# Table for CAN(6,k,19) 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;6,k,19) 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 20 47045881 orthogonal array 21 91615663 extend by one factor 22 136185445 extend by one factor 24 148035885 fuse symbols 25 188183521 perfect hash family 40 232753306 Martirosyan-Tran van Trung 41 363987256 extend by one factor 42 495221206 extend by one factor 43 517504681 perfect hash family 45 611596441 perfect hash family 50 658642321 perfect hash family 95 705688201 perfect hash family 362 752734081 Power 20^2 363 968545315 extend by one factor 364 1193245813 extend by one factor 366 1364330521 perfect hash family 515 1505468161 perfect hash family 516 1885724623 extend by one factor 520 2117064601 perfect hash family 530 2368574145 Power 24^2 722 2479876726 Martirosyan-Tran van Trung 724 2516421478 Martirosyan-Tran van Trung 726 2854460092 Martirosyan-Tran van Trung 728 3196488154 Martirosyan-Tran van Trung 732 3367572862 Martirosyan-Tran van Trung 1372 3491299576 linear hash family 1373 3998357326 extend by one factor 1374 4505415076 extend by one factor 1375 5012472826 extend by one factor 1681 5095821571 linear hash family 1682 5602879321 extend by one factor 1805 6021872641 perfect hash family 1806 6528930391 extend by one factor 1810 6586423201 perfect hash family 1830 6633469081 perfect hash family 2415 6774606721 perfect hash family 10000 7215352456 Power 31^3
Graph: