Enumeration of Williamson sequences divisible by 2 or 3

These files contain an enumeration of all inequivalent Williamson sequences of orders divisible by 2 or 3 and up to 70 as defined in the paper "Applying Computer Algebra Systems with 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.

A table with the sequence counts in each file is also available.