A code is usually represented by a generating matrix. The row space of the generating matrix is the code itself.
Selfdual codes are codes such all codewords are pairwise orthogonal to each other.
Two codes are called permutation equivalent if one code can be obtained by permuting the coordinates (columns) of the other code.
The automorphism group of a code is the set of permutations of the coordinates (columns) that result in the same identical code.
The values in the sequence are not calculated lower bounds. For each n there exists a binary selfdual code of length 2n with an automorphism group of size a(n).
Binary selfdual codes have been classified (accounted for) up to a certain length. The classification process requires the automorphism group size be known for each code. There is a mass formula to calculate the number of distinct binary selfdual codes of a given length. Sequence A028362gives this count. The automorphism group size allows researchers to calculate the number of codes that are permutationally equivalent to a code. Each new binary selfdual code C of length m that is discovered will account for m!/aut(C) codes in the total number calculated by the mass formula. Aut(C) represents the automorphism size of the code C. Sequence A003179 gives number of binary selfdual codes up to permutation equivalence.
The values in the sequence are not calculated by a formula or algorithm. They are the result of calculating the number of divisors for every automorphism group of every binary selfdual code.
The number of divisors a(n) does count 1 and the number itself.
In general the automorphism group size with the largest number of divisors is not unique.
In general the automorphism group size with the largest number of divisors is not the largest group automorphism group size for a given binary selfdual code length.
