login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A198342 Number of non-solvable transitive permutation groups for polynomials of degree n. 1
0, 0, 0, 0, 2, 4, 3, 5, 4, 21, 4, 36, 3, 27, 40, 49, 5, 91, 2, 358, 56, 27, 3, 807, 79, 26, 64, 617, 2, 1896, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
For prime degrees of polynomials see A201443.
All non-solvable groups are non-commutative.
Is this the same as A124938 ? - R. J. Mathar, Oct 04 2018
LINKS
EXAMPLE
a(4)=0 because for quartic polynomials all groups are solvable.
a(5)=2 because for quintic polynomials we have two non-solvable groups: A(5) and S(5).
PROG
(Magma) // for a(16):
for g in [1..1954] do
G:=TransitiveGroup(16, g);
IsSolvable(G);
end for
CROSSREFS
Sequence in context: A053049 A306762 A124938 * A081725 A228083 A222234
KEYWORD
nonn,hard,more
AUTHOR
Artur Jasinski, Oct 23 2011
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 19:48 EDT 2024. Contains 371754 sequences. (Running on oeis4.)