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.

Previous Showing 11-20 of 25 results. Next

A119648 Orders for which there is more than one simple group.

Original entry on oeis.org

20160, 4585351680, 228501000000000, 65784756654489600, 273457218604953600, 54025731402499584000, 3669292720793456064000, 122796979335906113871360, 6973279267500000000000000, 34426017123500213280276480
Offset: 1

Views

Author

N. J. A. Sloane, Jul 29 2006

Keywords

Comments

All such orders are composite numbers (since there is only one group of any prime order).
Orders which are repeated in A109379.
Except for the first number, these are the orders of symplectic groups C_n(q)=Sp_{2n}(q), where n>2 and q is a power of an odd prime number (q=3,5,7,9,11,...). Also these are the orders of orthogonal groups B_n(q). - Dushan Pagon (dushanpag(AT)gmail.com), Jun 27 2010
a(1) = 20160 = 8!/2 is the order of the alternating simple group A_8 that is isomorphic to the Lie group PSL_4(2), but 20160 is also the order of the Lie group PSL_3(4) that is not isomorphic to A_8 (see A137863). - Bernard Schott, May 18 2020

Examples

			From Dushan Pagon (dushanpag(AT)gmail.com), Jun 27 2010: (Start)
a(1)=|A_8|=8!/2=20160,
a(2)=|C_3(3)|=4585351680,
a(3)=|C_3(5)|=228501000000000, and
a(4)=|C_4(3)|=65784756654489600. (End)
		

References

  • See A001034 for references and other links.
  • J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker and R. A. Wilson, ATLAS of Finite Groups. Oxford Univ. Press, 1985 [for best online version see https://oeis.org/wiki/Welcome#Links_to_Other_Sites]. [From Dushan Pagon (dushanpag(AT)gmail.com), Jun 27 2010]

Crossrefs

Cf. A001034 (orders of simple groups without repetition), A109379 (orders with repetition), A137863 (orders of simple groups which are non-cyclic and non-alternating).

Programs

  • Other
    sp(n, q) 1/2 q^n^2.(q^(2.i) - 1, i, 1, n) [From Dushan Pagon (dushanpag(AT)gmail.com), Jun 27 2010] [This line contained some nonascii characters which were unreadable]

Formula

For n>1, a(n) is obtained as (1/2) q^(m^2)Prod(q^(2i)-1, i=1..m) for appropriate m>2 and q equal to a power of some odd prime number. [Dushan Pagon (dushanpag(AT)gmail.com), Jun 27 2010]

Extensions

Extended up to the 10th term by Dushan Pagon (dushanpag(AT)gmail.com), Jun 27 2010

A137863 Orders of simple groups which are non-cyclic and non-alternating.

Original entry on oeis.org

168, 504, 660, 1092, 2448, 3420, 4080, 5616, 6048, 6072, 7800, 7920, 9828, 12180, 14880, 20160, 25308, 25920, 29120, 32736, 34440, 39732, 51888, 58800, 62400, 74412, 95040, 102660, 113460, 126000, 150348, 175560, 178920, 194472, 246480, 262080
Offset: 1

Views

Author

Artur Jasinski, Feb 16 2008

Keywords

Comments

From Bernard Schott, Apr 26 2020: (Start)
About a(16) = 20160; 20160 = 8!/2 is the order of the alternating simple group A_8 that is isomorphic to the Lie group PSL_4(2), but, 20160 is also the order of the Lie group PSL_3(4) that is not isomorphic to A_8.
Indeed, 20160 is the smallest order for which there exist two nonisomorphic simple groups and it is the order of this group PSL_3(4) that was missing in the data. The first proof that there exist two nonisomorphic simple groups of this order was given by the American mathematician Ida May Schottenfels (1900) [see the link]. (End)

Examples

			From _Bernard Schott_, Apr 27 2020: (Start)
Two particular examples:
a(1) = 168 is the order of the smallest non-cyclic and non-alternating simple group, this Lie group is the projective special linear group PSL_2(7) that is isomorphic to the general linear group GL_3(2).
a(12) = 7920 is the order of the smallest sporadic group (A001228), the Mathieu group M_11. (End)
		

References

  • L. E. Dickson, Linear groups, with an exposition of the Galois field theory (Teubner, 1901), p. 309.

Crossrefs

Subsequence: A001228 (sporadic groups).

Extensions

More terms from R. J. Mathar, Apr 23 2009
a(16) = 20160 inserted by Bernard Schott, Apr 26 2020
Incorrect formula and programs removed by R. J. Mathar, Apr 27 2020
Terms checked by Bernard Schott, Apr 26 2020

A338757 Number of splitting-simple groups of order n; number of nontrivial groups of order n that are not semidirect products of proper subgroups.

Original entry on oeis.org

0, 1, 1, 1, 1, 0, 1, 2, 1, 0, 1, 0, 1, 0, 0, 2, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 5, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 19, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 2, 0, 1, 0, 0, 0, 0, 0, 1
Offset: 1

Views

Author

Jianing Song, Nov 07 2020

Keywords

Comments

The other names for groups of this kind include "semidirectly indecomposable groups" or "inseparable groups". Note that the following are equivalent definitions for a nontrivial group to be a splitting-simple group:
- It is not the (internal) semidirect product of proper subgroups;
- It is not isomorphic to the (external) semidirect product of nontrivial groups;
- It has no proper nontrivial normal subgroups with a permutable complement.
- It is the non-split extension of every proper nontrivial normal subgroup by the corresponding quotient group.
Also note that being simple is a stronger condition than being splitting-simple, while being directly indecomposable (see A090751) is weaker.
a(p^e) >= 1 since C_p^e cannot be written as the semidirect product of proper subgroups. For e >= 3, a(2^e) >= 2 by the existence of the generalized quaternion group of order 2^e, which is the only non-split extension of C_2^(e-1) by C_2 other than C_2^e.
The smallest numbers here with a(n) > 0 that are not prime powers are 48, 60, 120, 144, 168, 192, 240, 320, 336, 360 and so on. Are there any odd numbers n that are not prime powers satisfying a(n) > 0 ?
Conjecture: a(n) = 0 for squarefree n which is not a prime.
The conjecture that a(n) = 0 for nonprime squarefree n is true. Proof: It is known that every group G of squarefree order is supersolvable; hence G contains a normal series with prime cyclic factors. Since every Sylow subgroup of G is prime cyclic, these cyclic factors are isomorphic to the Sylow subgroups of G. Let P be one such factor; then for an appropriate M in G, P = G/M, where |G| = |P|*|M|. By the Schur-Zassenhaus theorem, G is a semidirect product of M and P, and a(n) = 0 when n is squarefree. - Miles Englezou, Oct 24 2024

Examples

			a(48) = 1 because the binary octahedral group, which is of order 48, cannot be written as the semidirect product of proper subgroups.
a(16) = 2, and the corresponding groups are C_16 and Q_16 (generalized quaternion group of order 16).
a(81) = 2, and the corresponding groups are C_81 and SmallGroup(81,10).
a(64) = 19, and the corresponding groups are SmallGroup(64,i) for i = 1, 11, 13, 14, 19, 22, 37, 43, 45, 49, 54, 79, 81, 82, 160, 168, 172, 180 and 245.
For n = 60 or 168, the unique simple group is the only group of order n that cannot be written as the semidirect product of proper subgroups, hence a(60) = a(168) = 1. [The unique simple groups are respectively Alt(5) and PSL(2,7). - _Bernard Schott_, Nov 08 2020]
For n = 12, we have C_12 = C_3 X C_4, C_6 X C_2 = C_6 X C_2, D_6 = C_6 : C_2, Dic_12 = C_3 : C_4 and A_4 = (C_2 X C_2) : C_3, all of which can be written as the semidirect product of nontrivial groups. So a(12) = 0.
		

Crossrefs

Cf. A000001, A090751 (number of directly indecomposable groups of order n), A001034, A120944.

Programs

  • GAP
    IsSplittingSimple := function(G)
      local c, l, i;
      c := NormalSubgroups(G);
      l := Length(c);
      if l > 1 then
        for i in [2..l-1] do
        if Length(ComplementClassesRepresentatives(G,c[i])) > 0 then
          return false;
        fi;
        od;
        return true;
      else
        return false;
      fi;
    end;
    A338757 := n -> Length(AllSmallGroups( n, IsSplittingSimple ));

Formula

For primes p != q:
a(p) = a(p^2) = 1; a(p^3) = 2 for p = 2, 1 otherwise;
a(p^4) = 2 for p = 2 or 3, 1 otherwise;
a(pq) = 0;
a(4p) = a(8p) = 0, p > 2.
a(n) <= A090751(n) for all n, and the equality holds if n = 1, p, p^2 for primes p or n = pq for primes p < q and p does not divide q-1.
a(A001034(k)) >= 1, since A001034 lists the orders of (non-Abelian) simple groups.
a(A120944(n)) = 0. - Miles Englezou, Oct 24 2024

A338853 List of numbers k > 1 such that there exists a group of order k without nontrivial normal Sylow subgroups.

Original entry on oeis.org

24, 48, 60, 72, 96, 120, 144, 160, 168, 180, 192, 216, 240, 288, 300, 320, 324, 336, 360, 384, 432, 480, 504, 540, 576, 600, 640, 648, 660, 672, 720, 768, 784, 800, 840, 864, 896, 900, 960, 972, 1008, 1053, 1080, 1092, 1152, 1176, 1200, 1280, 1296, 1320, 1344, 1440
Offset: 1

Views

Author

Jianing Song, Nov 12 2020

Keywords

Comments

Equivalently, numbers k > 1 such that there exists a group of order k with Sylow number > 1 for every prime dividing k.
The corresponding numbers of groups of order k without nontrivial normal Sylow subgroups are: 1, 4, 1, 4, 17, 3, 17, 1, 1, 1, 86, 18, 8, 90, 1, 5, 1, 3, 6, 536, 80, 27, ...
Note that if G has no normal Sylow p-subgroups, p divides |G|, then G X C_p also has no normal Sylow p-subgroups. That is to say, if k is in this sequence and p divides k, then k*p is also in this sequence. In particular, every number of the form 24 * 2^a * 3^b * 5^c * 7^d with nonnegative a,b,c,d is here.
The "primitive" terms (the terms not of the form k*p where k is a previous term and p divides k) are 24, 60, 160, 168, 324, 660, 784, 840, 896, 1053, ...
Includes A001034 as a subsequence, by the definition of non-cyclic simple groups. If q is not a prime power (not in A246655) and A338757(q) > 0, then q is here, as guaranteed by Schur-Zassenhaus theorem.
If k = p^e * q is here, p, q distinct primes, then q == 1 (mod p) and e >= 1+ord(p,q), where ord(p,q) is the multiplicative order of p modulo q. Proof: Let G be a group of order k without nontrivial normal Sylow subgroups. Let n_p (respectively n_q) be the number of Sylow p-subgroups (respectively q-subgroups), then n_p, n_q > 1. By Sylow's 3rd theorem, we have n_p == 1 (mod p), n_p | q; n_q == 1 (mod q), n_q | p^e. It is possible only if q == 1 (mod p) and e >= ord(p,q).
If e = ord(p,q), then we must have n_q = p^e. The Sylow q-subgroups have order q, which is a prime, so the pairwise intersections must be trivial, i.e., there are p^e * (q-1) = k - p^e elements in G of order q. The remaining p^e elements are just enough to make a unique Sylow p-subgroup, so n_p = 1, which is a contradiction. Hence, e >= 1+ord(p,q).
The terms of the form p^e * q where e = 1+ord(p,q), q == 1 (mod p) are 24 = 2^3 * 3, 160 = 2^5 * 5, 1053 = 3^4 * 13 and so on. Note that q == 1 (mod p) and e >= 1+ord(p,q) are only necessary but not sufficient: 112 = 2^4 * 7 satisfies 7 == 1 (mod 2) and 4 >= 1+ord(2,7), but 112 is not here. Similarly, 19375 = 5^4 * 31 satisfies 31 == 1 (mod 5) and 4 >= 1+ord(5,31), but 19375 is not here.

Examples

			All the normal subgroups of S_4 (symmetric group of degree 4, order 24) are the trivial group, the Klein four-group (order 4), A_4 (alternating group of degree 4, order 12) and S_4 itself. None of these is a Sylow 2-subgroup or a Sylow 3-subgroup. So 24 is a term.
All the normal subgroups of SmallGroup(1053,51) are the trivial group, C_3 X C_3 X C_3 (order 27), SmallGroup(351,12) and SmallGroup(1053,51) itself. None of these is a Sylow 3-subgroup or a Sylow 13-subgroup. So 1053 is a term. In fact, 1053 is the smallest odd term. [As a result, every number of the form 1053 * 3^a * 13^b with nonnegative a,b is a term, showing that there are infinitely many odd terms in this sequence. What is the smallest odd term not of this form? - _Jianing Song_, Sep 08 2021]
		

Crossrefs

Programs

  • GAP
    HasNoSylow := function(G)
      local c, l, i;
      c := FactInt(Size(G))[1];
      l := Length(c);
      if c[1] = c[l] then     # |G| is 1 or a prime power
        return false;
      else
        for i in [1..l] do
          if IsNormal(G, SylowSubgroup(G, c[i])) then
            return false;
          fi;
        od;
        return true;
      fi;
    end;
    IsA338853 := function(n)
      local c, l, i;
      c := FactInt(n)[1];
      l := Length(c);
      if c[1] = c[l] then     # |G| is 1 or a prime power
        return false;
      else
        i := NumberSmallGroups(n);
        while i > 0 do
          if(HasNoSylow(SmallGroup(n,i))) then
            return true;
          fi;
          i := i-1;
        od;
        return false;
      fi;
    end;

A341293 Smallest order of a non-abelian group with a commutator subgroup of index n.

Original entry on oeis.org

60, 6, 12, 8, 55, 18, 56, 16, 27, 30, 253, 24, 351, 42, 60, 32, 1020, 54, 1140, 40, 84, 66, 1081, 48, 125, 78, 81, 56, 1711, 90, 992, 64, 132, 102, 280, 72, 2220, 114, 156, 80, 2460, 126, 2580, 88, 135, 138, 2820, 96, 343, 150, 204, 104, 3180, 162, 605, 112, 228, 174, 3540, 120, 3660
Offset: 1

Views

Author

Bob Heffernan and Des MacHale, Feb 05 2021

Keywords

Comments

By Lagrange's Theorem a(n) is a multiple of n.

Examples

			Examples for small n:
n a(n) group
1  60  A5
2  6  S3
3  12  A4
4  8  D8
5  55  C11 : C5
6  18  C3 x S3
7  56  (C2 x C2 x C2) : C7
8  16  (C4 x C2) : C2
9  27  (C3 x C3) : C3
10  30  C5 x S3
11  253  C23 : C11
12  24  C3 x D8
		

Crossrefs

A119631 Orders of non-Abelian simple groups of rank at least four.

Original entry on oeis.org

60, 360, 2520, 7920, 20160, 95040, 175560, 181440, 443520, 604800, 1814400, 9999360, 10200960, 13685760, 17971200, 19958400, 44352000, 50232960, 174182400, 197406720, 211341312, 239500800, 244823040, 898128000
Offset: 1

Views

Author

N. J. A. Sloane, Jun 10 2006

Keywords

Comments

This includes all the sporadic simple groups (A001228) except one (the Monster).

Crossrefs

A131933 a(n) = A056866(n)/4.

Original entry on oeis.org

15, 30, 42, 45, 60, 75, 84, 90, 105, 120, 126, 135, 150, 165, 168, 180, 195, 210, 225, 240, 252, 255, 270, 273, 285, 294, 300, 315, 330, 336, 345, 360, 375, 378, 390, 405, 420, 435, 450, 462, 465, 480, 495, 504, 510, 525, 540, 546, 555, 570, 585, 588, 600, 612
Offset: 1

Views

Author

Artur Jasinski, Jul 30 2007

Keywords

Comments

All orders of nonsolvable groups A056866 are divisible by 4.

Crossrefs

A352287 Numbers k such that, for every prime p dividing k, k has a nontrivial divisor which is congruent to 1 (mod p).

Original entry on oeis.org

1, 12, 24, 30, 36, 48, 56, 60, 72, 80, 90, 96, 105, 108, 112, 120, 132, 144, 150, 160, 168, 180, 192, 210, 216, 224, 240, 252, 264, 270, 280, 288, 300, 306, 315, 320, 324, 336, 351, 360, 380, 384, 392, 396, 400, 420, 432, 448, 450, 480, 495, 504, 520, 525, 528, 540, 546, 552, 560, 576, 600
Offset: 1

Views

Author

David Speyer, Mar 10 2022

Keywords

Comments

When considering whether an integer k is the order of a finite simple group, the first thing one checks is whether the number of p-Sylow subgroups is forced to be 1 for some p dividing k. This occurs if the only divisor of k which is 1 (mod p) is 1 itself. This sequence consists of the numbers that survive this test.

Examples

			105 is in the sequence, since it is divisible by 7 which is 1 (mod 3), 21 which is 1 (mod 5), and 15 which is 1 (mod 7).
		

Crossrefs

Programs

  • Mathematica
    divq[n_, p_] := AnyTrue[Rest @ Divisors[n], Mod[#, p] == 1 &]; q[1] = True; q[n_] := AllTrue[FactorInteger[n][[;; , 1]], divq[n, #] &]; Select[Range[600], q] (* Amiram Eldar, May 05 2022 *)
  • PARI
    isok(k) = {my(f=factor(k), d=divisors(f)); for (i=1, #f~, if (vecsum(apply(x->((x % f[i,1]) == 1), d)) == 1, return(0)); ); return(1);} \\ Michel Marcus, Mar 11 2022
    
  • Sage
    print([ n for n in range(1, 601)
            if set( prime_factors(n) )
            == set( p for p in prime_factors(n)
                    for d in divisors(n)
                    if d > 1 and d < n
                    if p.divides(d - 1)
          ) ] )  # Peter Luschny, Mar 14 2022

A369625 Frobenius-Perron dimensions of simple integral fusion rings of rank 4.

Original entry on oeis.org

574, 7315, 63436, 65971, 68587, 90590, 113310, 310730, 311343, 494102, 532159, 585123, 1012810, 1043710, 1107139, 1152907, 1185558, 1343202, 1411338, 1419779, 1425114, 1483682, 1745610, 1898038, 1916226, 2112179, 2161715, 2175315, 2630642, 2753395, 2898555
Offset: 1

Views

Author

Sébastien Palcoux, Jan 27 2024

Keywords

Comments

See A348305 for the basic definitions and references about fusion rings, or page 60 in Etingof et al. The "rank" of a fusion ring is the cardinal of its basis. The Frobenius-Perron dimension (FPdim) of a fusion ring is the sum of the square of the FPdim of its basic elements.
A fusion ring is called "integral" if the FPdim of its basic elements are integers. The group ring ZG is an example of integral fusion ring, where the finite group G is the basis. The character ring ch(G) is another example of integral fusion ring, where the basis is the set of irreducible characters.
A fusion ring is called "simple" if it has no proper nontrivial fusion subring. The fusion ring ch(G) is simple iff the finite group G is simple.
The fusion ring ch(G) remembers the simple group G (not true for non-simple groups, e.g., D4 and Q8), moreover there are plenty of simple integral fusion rings not of the form ch(G). So a classification of simple integral fusion rings would "really" extend CFSG.
The minimal rank for a non-pointed simple integral fusion ring of the form ch(G) is 5, given by G=A5. But in general, the minimal rank for a simple integral fusion ring is 4, as proved in Alekseyev et al.
The list of twelve simple integral fusion rings of rank 4 and FPdim < 10^6 is available in slide 19 of the talk "Exotic Integral Quantum Symmetry" in the Links section.

References

  • W. Bruns and S. Palcoux, Classifying simple integral fusion rings, work in progress.
  • P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Mathematical Surveys and Monographs Volume 205 (2015).

Crossrefs

Programs

  • Python
    # requires Normaliz from version 3.10.2
    import math
    import PyNormaliz
    from PyNormaliz import *
    NmzSetNumberOfNormalizThreads(1)
    def function(N):
        L = []
        sN1 = math.isqrt(N//3)
        sN = math.isqrt(N)
        for i1 in range(3, sN1):
            m1 = min(sN, N - i1**2, i1**2 + 1)
            for i2 in range(i1+1, m1):
                m2 = min(sN, N - i1**2 - i2**2, i2**2 + 1)
                for i3 in range(i2+1, m2):
                    n = 1 + i1**2 + i2**2 + i3**2
                    if n <= N:
                        C = Cone(fusion_type = [[1,i1,i2,i3]])
                        l = C.FusionRings()
                        if len(l)>0:
                            L.append(n)
        L.sort()
        return(L)
    print(function(1000))

Extensions

Terms a(13) and beyond from Sébastien Palcoux, Dec 30 2024

A371037 Orders of almost simple groups.

Original entry on oeis.org

60, 120, 168, 336, 360, 504, 660, 720, 1092, 1320, 1440, 1512, 2184, 2448, 2520, 3420, 4080, 4896, 5040, 5616, 6048, 6072, 6840, 7800, 7920, 8160, 9828, 11232, 12096, 12144, 12180, 14880, 15600, 16320, 19656, 20160, 24360, 25308, 25920, 29120, 29484, 29760, 31200, 32736, 34440
Offset: 1

Views

Author

Sébastien Palcoux, Mar 08 2024

Keywords

Comments

A group G is almost simple if there exists a (non-abelian) simple group S for which S <= G <= Aut(S).

Examples

			For n = 1, 2, 3, 4 the values a(n) = 60, 120, 168, 336 correspond to the groups A5, S5, PSL(2,7), PGL(2,7), respectively.
		

Crossrefs

Cf. A001034.

Programs

  • GAP
    m := 100000;;
    L := [];;
    it := SimpleGroupsIterator(2, m);;
    for g in it do
        ag := AutomorphismGroup(g);;
        iag := InnerAutomorphismsAutomorphismGroup(ag);;
        Inter := IntermediateSubgroups(ag, iag).subgroups;;
        LL := [Order(ag), Order(iag)];;
        for h in Inter do
            Add(LL, Order(h));;
        od;
        for o in LL do
            if o <= m and (not o in L) then
                Add(L, o);;
            fi;
        od;
    od;
    Sort(L);;
    Print(L);;
Previous Showing 11-20 of 25 results. Next