cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A124937 Number of solvable transitive Galois groups for polynomials of degree n.

Original entry on oeis.org

1, 1, 2, 5, 3, 12, 4, 45, 30, 24, 4, 265, 6, 36, 64, 1905, 5, 892, 6, 759, 108, 32, 4, 24193, 132, 70, 2328, 1237, 6, 3816, 8
Offset: 1

Views

Author

Artur Jasinski, Nov 13 2006

Keywords

Examples

			a(5) = 3: for polynomials of degree 5 we have 3 solvable groups: C5 (T5_1), D5 (T5_2) and F5(T5_3)
		

Crossrefs

Programs

  • GAP
    "a(15)= "; l:=AllTransitiveGroups(NrMovedPoints,15,IsSolvable,true); # Artur Jasinski, Feb 04 2007
    
  • Magma
    // a(10)
    for g in [1..45] do
    G:=TransitiveGroup(10,g);
    IsSolvable(G);
    end for;

Extensions

More terms from Artur Jasinski, Feb 04 2007

A198342 Number of non-solvable transitive permutation groups for polynomials of degree n.

Original entry on oeis.org

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
Offset: 1

Views

Author

Artur Jasinski, Oct 23 2011

Keywords

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

Examples

			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).
		

Crossrefs

Programs

  • Magma
    // for a(16):
    for g in [1..1954] do
    G:=TransitiveGroup(16,g);
    IsSolvable(G);
    end for
Showing 1-2 of 2 results.