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.

A226512 a(n) = minimum of sum of orders of all elements of G, where G is a group of order n.

Original entry on oeis.org

1, 3, 7, 7, 21, 13, 43, 15, 25, 31, 111, 31, 157, 57, 147, 31, 273, 43, 343, 71, 85, 133, 507, 67, 121, 183, 79, 157, 813, 177, 931, 63, 777, 307, 903, 111, 1333, 381, 235, 163, 1641, 183, 1807, 377, 525, 553, 2163, 127, 337, 171, 1911, 287, 2757, 133, 331, 351, 457, 871, 3423, 211
Offset: 1

Views

Author

N. J. A. Sloane, Jun 13 2013

Keywords

Examples

			For n=6 the group S_3 is optimal: it has one element of order 1, 3 of order 2, and 2 of order 3, for a total of a(6) = 13.
		

Crossrefs

Cf. A057660.

Programs

  • Magma
    // Program from G. Nebe, Jun 14 2013
    SS:=[];
    for i in [1..200] do f:=[];
    for j in [1..NumberOfSmallGroups(i)] do p:=0; G:=SmallGroup(i,j);
    for g in G do p+:= Order(g); end for; Append(~f,p); end for;
    Append(~SS,Minimum(f)); end for;
    SS;

Formula

If p is prime, a(p) = A057660(p).

Extensions

More terms from G. Nebe, Jun 14 2013