|
|
A193024
|
|
The number of isomorphism classes of Alexander (a.k.a. affine) quandles of order n.
|
|
2
|
|
|
1, 1, 2, 3, 4, 2, 6, 7, 11, 4, 10, 6, 12, 6, 8, 23, 16, 11, 18, 12, 12, 10, 22, 14, 39, 12, 45, 18, 28, 8, 30, 48, 20, 16, 24, 33, 36, 18, 24, 28, 40, 12, 42, 30, 44, 22, 46, 46, 83, 39, 32, 36, 52, 45, 40, 42, 36, 28, 58, 24, 60, 30, 66, 167, 48, 20, 66, 48
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Nelson enumerated Alexander quandles to order 16 (see the links below). The values of a(n) for n from 1 to 255 were obtained via a GAP program using ideas from Hou (see the link below).
|
|
LINKS
|
|
|
PROG
|
(GAP)
findY:=function(f, g)
local Y, y;
Y:=[];
for y in g do
Add(Y, Image(f, y^(-1))*y);
od;
Y:=Set(Y);
return Subgroup(g, Y);
end;;
Alex:=[];; k:=8;;
for nn in [1..2^k-1] do
Alex[nn]:=0;
od;
for n in [1..2^k-1] do
LGn:=AllSmallGroups(n, IsAbelian);
for g in LGn do
autg:=AutomorphismGroup(g);;
eautg:=List(ConjugacyClasses(autg), Representative);
for f in eautg do
N2:=findY(f, g);
MM:= ((Size(g)^2)/Size(N2));
for nn in [1..2^k-1] do
if nn mod MM = 0 then
Alex[nn]:=Alex[nn]+1;
fi;
od;
od;
od;
od;
for nn in [1..2^k-1] do
Print(Alex[nn], ", ");
od;;
|
|
CROSSREFS
|
See Index to OEIS under quandles.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|