|
|
A196111
|
|
Number of isomorphism classes of simple quandles of order n.
|
|
1
|
|
|
1, 1, 1, 3, 0, 5, 2, 3, 1, 9, 1, 11, 0, 2, 3, 15, 0, 17, 2, 2, 0, 21, 1, 10, 0, 8, 2, 27, 1, 29, 6, 0, 0, 0, 3, 35, 0, 0, 2, 39, 3, 41, 0, 3, 0, 45
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,4
|
|
COMMENTS
|
A quandle is simple if it has more than one element, and if it has no homomorphic images other than itself or the singleton quandle. Since a simple quandle with more than two elements is connected, we have a(n) <= A181771(n), for n > 2, with equality if n is prime.
Some authors consider the quandle with one element to be simple and some do not.
|
|
LINKS
|
|
|
FORMULA
|
a(p) = A181771(p) = p - 2, for prime p > 2.
|
|
EXAMPLE
|
a(2) = 1 since the quandle of order 2 is trivially simple (though not connected).
|
|
PROG
|
(GAP) (using the Rig package)
LoadPackage("rig");
IsSimpleQuandle:=function(q)
local g, N, gg, n;
if IsFaithful(q) = false then return false; fi;
g:=InnerGroup(q);;
if Size(Center(g))>1 then return false; fi;
N:=NormalSubgroups(g);;
gg:=DerivedSubgroup(g);;
for n in N do
if Size(n) = 1 then continue; fi;
if IsSubset(gg, n) and Size(n)<Size(gg) then return false; fi;
od;
return true;
end;;
a:=[1, 1];;
for n in [3..35] do
a[n]:=0;
for i in [1..NrSmallQuandles(n)] do
if IsSimpleQuandle(SmallQuandle(n, i)) then
a[n]:=a[n]+1;
fi;
od;
od;
|
|
CROSSREFS
|
See also Index to OEIS under quandles.
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|