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.

A137315 a(n) is the least number m such that any finite group of order at least m has at least n automorphisms.

Original entry on oeis.org

1, 3, 7, 7, 13, 13, 19, 19, 31, 31, 31, 31, 43, 43, 43, 43, 61, 61, 61, 61, 67, 67, 67, 67, 91, 91, 91, 91, 91, 91, 91, 91, 121, 121, 121, 121, 127, 127, 127, 127, 151, 151, 151, 151, 151, 151, 151, 151
Offset: 1

Views

Author

Benoit Jubin, Apr 06 2008, May 26 2008

Keywords

Comments

a(n) <= (n-1)^(n + (n-2)[log_2(n-1)]) for n > 4 [Ledermann, Neumann, Thm. 6.6].
a(n) is odd [MacHale, Sheehy, Thm. 15].
a(2n-1) = a(2n) for 1 < n < 204 [ibid.].
The case of cyclic groups shows that a(n)>=A139795(n). This inequality can be strict: if M denotes the Mathieu group M_{22} of order 2^7.3^2.5.7.11, then Aut(12.M) = M.2, so that a(2^8.3^2.5.7.11 + 1) > 2^9.3^3.5.7.11, but A139795(2^8.3^2.5.7.11 + 1) = 2.3.5.7^2.11.13.23 + 1 < 2^9.3^3.5.7.11.

Examples

			a(3) = a(4) = 7 because every finite group with at least 7 elements has at least 4 automorphisms while the cyclic group of order 6 has only phi(6)=2 automorphisms.
		

Crossrefs

Different from A139795 (see Comments).
See also A340521.

A341823 Number of finite groups G with |Aut(G)| = 2^n.

Original entry on oeis.org

2, 3, 4, 7, 11, 19, 34, 70
Offset: 0

Views

Author

Des MacHale, Feb 20 2021

Keywords

Comments

This sequence is infinite, but the amount of computation needed to consider the large number of groups of order 2^8 suggests it may be hard to find the next term.

Examples

			a(3) = 7, because there are seven finite groups G with |Aut(G)| = 8. Four cyclic groups: Aut(C_15) = Aut(C_16) = Aut(C_20) = Aut(C_30) ~~ C_4 x C_2, also Aut(C_4 x C_2) = Aut(D_4) ~~ D_4, with D_4 is the dihedral group of the square, finally Aut(C_24) ~~ C_2 x C_2 x C_2 = (C_2)^3 where ~~ stands for “isomorphic to". - _Bernard Schott_, Mar 04 2021
		

Crossrefs

Subsequence of A340521.

Extensions

Offset modified by Bernard Schott, Mar 04 2021

A341824 Number of groups of order 2^n which occur as Aut(G) for some finite group G.

Original entry on oeis.org

1, 1, 2, 3, 4, 9, 14, 33
Offset: 0

Views

Author

Des MacHale, Feb 26 2021

Keywords

Comments

The number of groups of order 2^n is A000679(n); the percentage of the 2-groups which occur as automorphism groups appears to decrease as n increases: 100, 100, 100, 60, 28.5, 17.6, 5.2, 1.4, ...
Jianing Song remarks that it is also interesting to consider infinite groups, and asks if there is an infinite group G with Aut(G) isomorphic to C_8. Des MacHale, Mar 03 2021, replies that at present this is not known. [Comment edited by N. J. A. Sloane, Mar 07 2021]

Examples

			a(5) = 9 because there are nine groups of order 32 which occur as automorphism groups of finite groups.
From _Bernard Schott_, Feb 26 2021: (Start)
Aut(C_15) = Aut(C_16) = Aut(C_20) = Aut(C_30) ~~ C_4 x C_2 where ~~ stands for "isomorphic to".
Aut(C_4 x C_2) = Aut(D_4) ~~ D_4 where D_4 is the dihedral group of the square.
Aut(C_24) ~~ C_2 x C_2 x C_2 = (C_2)^3.
There exist five groups of order 8 (A054397), the three groups C_4 x C_2, D_4, C_2 x C_2 x C_2 occur as automorphim groups of order 8, but the cyclic group C_8 and the quaternions group Q_8 never occur as Aut(G) for some finite G, so a(3) = 3. (End)
		

Crossrefs

Formula

a(n) <= A000679(n). - Des MacHale, Mar 02 2021

Extensions

Offset modified by Jianing Song, Mar 02 2021

A341825 Number of finite groups G with |Aut(G)| = n.

Original entry on oeis.org

2, 3, 0, 4, 0, 6, 0, 7, 0, 2, 0, 9, 0, 0, 0, 11, 0, 4, 0, 7, 0, 2, 0, 22, 0, 0, 0, 2, 0, 2, 0, 19, 0, 0, 0, 12, 0, 0, 0, 14, 0, 7, 0, 3, 0, 2, 0
Offset: 1

Views

Author

Des MacHale, Mar 02 2021

Keywords

Comments

The smallest odd index n > 1 for which a(n) > 0 is 2187 = 3^7 (see A340521).
There exist even indices n that are not values taken by totient function phi (A002202) for which a(n) > 0. For example, John Bray has produced a group G that is the semidirect product 19:9 of order 3^2*19 = 171 such that |Aut(G)| = 1026 = 2*3^3*19.

Examples

			a(6) = 6, because there are six groups G with |Aut(G)| = 6. Four  cyclic groups: Aut(C_7) = Aut(C_9) = Aut(C_14) = Aut(C_18) ~~ C_6, and also Aut(C_2 x C_2) = Aut(S_3) ~~ S_3, where ~~ stands for “isomorphic to”. - _Bernard Schott_, Mar 02 2021
a(8) = 7, because there are seven groups G with |Aut(G)| = 8.
		

Crossrefs

Formula

a(2) = 3, a(p) = 0 if p odd prime.
a(A002202(n)) > 0, since |Aut(C_n)| = phi(n).

A368480 Orders k such that there exists a group of order k with automorphism group of odd order.

Original entry on oeis.org

1, 2, 2187
Offset: 1

Views

Author

Robin Jones, Dec 26 2023

Keywords

Examples

			a(1)=1 since the trivial group has automorphism group of order 1. a(2)=2 since C_2 has automorphism group of order 1.
		

Crossrefs

Showing 1-5 of 5 results.