These files contain an enumeration of all inequivalent Williamson sequences of even orders n up to 70 and orders n < 69 divisible by 3 as defined in the paper "Applying Computer Algebra Systems and SAT Solvers to the Williamson Conjecture" by Bright, Kotsireas, and Ganesh. Every line in each file contains exactly one Williamson sequence, with spaces separating the members A, B, C, and D of the Williamson sequences. The sequence entries are encoded using the characters + for 1 and - for −1.

https://cs.uwaterloo.ca/~cbright/willsat/