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

A185176 a(n) = maximal number of different Galois groups with that same order for polynomials of degree n.

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 8, 4, 5, 1, 30, 1, 5, 5, 260, 1, 43, 1, 57, 7, 4, 1, 1930, 8, 10, 99, 93, 1, 223, 1
Offset: 2

Views

Author

Artur Jasinski, Feb 19 2011

Keywords

Comments

For prime p, a(p)=1.
For nonprime n, the most frequently seen orders are:
4 = 4,
6 = 24,
8 = 32,
9 = 54,
10 = 200,
12 = 192,
14 = 2688,
15 = 360,
16 = 256,
18 = 1296,
20 = {5120,40000},
21 = 30618,
22 = 2420,
24 = 1536,
25 = {500,2500,12500},
26 = 4056,
27 = 4374,
28 = 114688,
30 = 24000000

Examples

			a(4)=2 because for polynomials of degree 4, there are two different groups of order 4.
a(20)=57 because for polynomials of degree 20, there are 57 different groups of order 5120 and 57 different groups of order 40000.
		

Crossrefs

Showing 1-1 of 1 results.