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-5 of 5 results.

A340511 Numbers k such that there exists a group of order k which has no subgroup of order d, for some divisor d of k.

Original entry on oeis.org

12, 24, 36, 48, 56, 60, 72, 75, 80, 84, 96, 108, 112, 120, 132, 144, 150, 156, 160, 168, 180, 192, 196, 200, 204, 216, 225, 228, 240, 252, 264, 276, 280, 288, 294, 300, 312, 320, 324, 336, 348, 351, 360, 363, 372, 375, 384, 392, 396, 400, 405, 408, 420
Offset: 1

Views

Author

Des MacHale, Jan 24 2021

Keywords

Comments

Suggested by the fact that the converse to Lagrange's theorem does not hold. These numbers might be called "Non-Converse Lagrange Theorem Orders".
A subsequence of A066085. The first difference between them is that 224 is missing from the present sequence (see MacHale-Manning, 2016). The sequence of terms of A066085 not in the present sequence is infinite, and begins 224, 2464, ... [This sequence is now A341048. - Bernard Schott, Feb 15 2021]
From Jianing Song, Dec 06 2021: (Start)
If k is a term, gcd(k,m) = 1, then k*m is again a term. Proof: If G is a group of order k without a subgroup of order k', then G X C_m has no subgroup of order k'*m. Suppose that it has, let G' be that subgroup. For every (a,b) in G', let m_0 be a multiple of m congruent to 1 modulo k, then (a,b)^(m_0) = (a,1) in G'; let k_0 be a multiple of k congruent to 1 modulo m, then (a,b)^(k_0) = (1,b) in G'. This shows that G' itself is of the form H X C_{m'}, where H is a subgroup of G and m' divides m. We have |H|*m' = k'*m, so |H| = k' and m' = m, contradicting with our assumption that G has no subgroup of order k'.
On the other hand, if gcd(k,m) > 1, then k*m need not be a term, as 56 is here but 224 is missing. In fact, N has a proper divisor here but N itself is not in this sequence if and only if N is in A341048. For the "only if" part, if N = k*m is a CLT order and k is a NCLT order, then k is a NSS order. Since every multiple of a NSS order is a NSS order, N is a NSS order, so by definition N is in A341048. The "if" part follows from MacHale-Manning, 2016, Corollary 13, Page 5.
Conjecture: If k = p^a*q^b, where p, q are primes, q !== 1 (mod p), b >= ord(q,p), then k is a term of this sequence, unless k is an NSS-CLT order of the form described in MacHale-Manning, 2016, Theorem 8, Page 5. Here ord(q,p) is the multiplicative order of q modulo p. Moreover, if k satisfies this condition, it seems that for each NCLT group of order k, the missing orders of subgroups are of the form p^a'*q^b' where either a' = a or b' = b, and a' = a if p == 1 (mod q) or a < ord(p,q). (End)

Examples

			12 belongs to this sequence because there is a group of order 12 (A_4) which has no subgroup of order 6, despite the fact that 6 divides 12.
		

Crossrefs

Extensions

a(35)-a(53) from Bernard Schott, Feb 15 2021

A340517 Primitive orders of non-supersolvable groups.

Original entry on oeis.org

12, 56, 75, 80, 196, 200, 294, 351, 363, 405
Offset: 1

Views

Author

Des MacHale, Jan 24 2021

Keywords

Comments

Primitive terms of A066085.
A closely related sequence would be the primitive terms in A340511, but for that we need more terms of A340511.

Crossrefs

A066083 Number of supersolvable groups of order n.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 4, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 12, 2, 2, 5, 4, 1, 4, 1, 51, 1, 2, 1, 11, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2, 1, 42, 2, 5, 1, 5, 1, 15, 2, 12, 2, 2, 1, 11, 1, 2, 4, 267, 1, 4, 1, 5, 1, 4, 1, 37, 1, 2, 2, 4, 1, 6, 1, 51
Offset: 1

Views

Author

Reiner Martin, Dec 29 2001

Keywords

Comments

A finite group is supersolvable if it has a normal series with cyclic factors. Huppert showed that a finite group is supersolvable iff the index of any maximal subgroup is prime.

Crossrefs

A341048 Numbers m such that there is a group of order m that is not supersolvable (NSS) but "converse Lagrange theorem" (CLT).

Original entry on oeis.org

224, 2464, 2912, 3159, 3808, 4256, 5152, 6318, 6496, 8288, 9184, 9632
Offset: 1

Views

Author

Bernard Schott, Feb 04 2021

Keywords

Comments

The converse to Lagrange's theorem does not hold. A340511 lists the numbers n such that there exists a group of order n which has no subgroup of order d, for some divisor d of n; they are called "non-converse Lagrange theorem" (NCLT) orders.
A finite group is supersolvable (SS) if it has a normal series of subgroups with cyclic factors; A066085 lists the numbers for which there exists a group of order n that is not supersolvable; they are called a "non-supersolvable" (NSS) order.
Theorem: Every NCLT order is an NSS order (see MacHale-Manning, 2016, Theorem 3, page 2); hence A340511 is a subsequence of A066085.
However, there exist infinitely many NSS orders that are not NCLT orders (see MacHale-Manning, 2016, Corollary 19, page 6) and these NSS-CLT orders are listed in this sequence.
Theorem: The number 224*p is an NSS-CLT order for all primes p <> 2, 3, 5, 7, 31 (see MacHale-Manning, 2016, Theorem 18, page 6). So, 10528, 11872, 13216, 13664, 15008, 15904, ... are other terms.

Examples

			There exist 197 groups of order 224, and one of these groups is NSS-CLT (see MacHale-Manning, 2016, Theorem 8, page 5); this group is NSS (A066085) but satisfies the converse of Lagrange theorem (CLT): for all divisors d of 224, this group has at least one subgroup of order d; hence, 224 is a term.
		

Crossrefs

Equals A066085 \ A340511.
Cf. A340517.

A173666 Partial sums of number of supersolvable groups of order n (A066083).

Original entry on oeis.org

1, 2, 3, 5, 6, 8, 9, 14, 16, 18, 19, 23, 24, 26, 27, 41, 42, 47, 48, 53, 55, 57, 58, 70, 72, 74, 79, 83, 84, 88, 89, 140, 141, 143, 144, 155, 156, 158, 160, 174, 175, 181, 182, 186, 188, 190, 191, 233, 235, 240, 241, 246, 247, 262, 264, 276, 278, 280, 281, 292, 293, 295, 299, 566, 567, 571, 572, 577, 578, 582, 583, 620, 621, 623, 625, 629, 630, 636, 637, 688
Offset: 1

Views

Author

Jonathan Vos Post, Nov 24 2010

Keywords

Comments

Number of supersolvable groups of order <= n. Diverges from A063756 after n=11. The subsequence of primes in this sequence begins: 2, 3, 5, 19, 23, 41, 47, 53, 79, 83, 89, 181, 191, 233, 241, 281, 293, 571, 577. The subsequence of perfect powers in this sequence begins: 1, 8, 9, 16, 27, 144, 625.

Crossrefs

Programs

Formula

a(n) = Sum_{i=1..n} A066083 = Sum_{i=1..n} number of finite groups of order i for which the index of any maximal subgroup is prime.
Showing 1-5 of 5 results.