Williamson sequences

The following files contain an enumeration of all inequivalent Williamson sequences of a given order \(n\) which is divisible by 2 or 3 under the following equivalence operations:

1. Reorder the sequences \(A, B, C, D\)in any way.
2. Negate all the entries in any of \(A, B, C\) or \(D\).
3. If \(n\) is even, cyclically shift all the entries in any of  \(A, B, C\) or \(D\) by an offset of \(n \over 2\).
4. Apply an automorphism of the cyclic group \(C_n\) to all the indices of the entries of \(A, B, C,\) and \(D\) simultaneously.
5. If \(n\) is even, negate every second entry in each of  \(A, B, C\) and \(D\) simultaneously.

Every line in each file contains exactly one Williamson sequence, with spaces separating the members   \(A, B, C\) and \(D\) of the Williamson sequence. The sequence entries are encoded using the characters + for 1 and - for −1. The sequences were constructed using a SAT+CAS method which is described in the paper Applying Computer Algebra Systems with SAT Solvers to the Williamson Conjecture by Bright, Kotsireas, and Ganesh.  They have also been archived on Zenodo.