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.

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

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).
Showing 1-2 of 2 results.