The following files contain a list of the inequivalent eight-Williamson sequences of a given order \(n\) that were found using the construction given in the paper by Applying Computer Algebra Systems with SAT Solvers to the Williamson Conjecture by Bright, Kotsireas, and Ganesh.
| order \(n\) | # sequences | filesize |
| 1 | 1 | 17 |
| 3 | 1 | 33 |
| 5 | 1 | 49 |
| 7 | 4 | 260 |
| 9 | 13 | 1.1K |
| 11 | 10 | 970 |
| 13 | 18 | 2.0K |
| 15 | 129 | 17K |
| 17 | 79 | 12K |
| 19 | 43 | 6.8K |
| 21 | 280 | 49K |
| 23 | 48 | 9.1K |
| 25 | 257 | 53K |
| 27 | 486 | 107K |
| 29 | 71 | 17K |
| 31 | 58 | 15K |
| 33 | 240 | 64K |
| 35 | 78 | 23K |